Dependence orders for computations of concurrent automata

DOI10.1007/3-540-59042-0_97MaRDI QIDQ4596645zbMATH OpenOpenAlexFDO

Authors Felipe Bracho, Manfred Droste, Dietrich Kuske

Publication date 4 December 2017

Published in STACS 95 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59042-0_97

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Representation of computations in concurrent automata by dependence orders
• CONCURRENT AUTOMATA AND DOMAINS
• From domains to automata with concurrency
• Recognizable languages in concurrency monoids
• Recognizable and logically definable languages of infinite computations in concurrent automata

Cited in

(14)

• Representation of computations in concurrent automata by dependence orders
• Labelled domains and automata with concurrency
• scientific article; zbMATH DE number 4047060 (Why is no real title available?)
• CONCURRENT AUTOMATA AND DOMAINS
• scientific article; zbMATH DE number 177814 (Why is no real title available?)
• Topology for Computations of Concurrent Automata
• From domains to automata with concurrency
• A Kleene theorem for recognizable languages over concurrency monoids
• scientific article; zbMATH DE number 3995041 (Why is no real title available?)
• Recognizable and logically definable languages of infinite computations in concurrent automata
• On the structure of recognizable languages of dependence graphs
• Asynchronous cellular automata for pomsets without auto-concurrency
• Languages and logical definability in concurrency monoids
• Recognizable languages in concurrency monoids

This page was built for publication: Dependence orders for computations of concurrent automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596645)