Distributed Asynchronous Automata

DOI10.1007/978-3-642-04081-8_9zbMath1254.68162OpenAlexW1530410512MaRDI QIDQ3184669

Nicolas Baudru

Publication date: 22 October 2009

Published in: CONCUR 2009 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04081-8_9

Mathematics Subject Classification ID

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

Related Items (2)

A quadratic construction for Zielonka automata with acyclic communication structure ⋮ Compositional synthesis of asynchronous automata

Cites Work

• Asynchronous mappings and asynchronous cellular automata
• A Kleene theorem and model checking algorithms for existentially bounded communicating automata
• A theory of regular MSC languages
• Determinizing Büchi asynchronous automata
• Unfolding Synthesis of Asynchronous Automata
• Constructing Exponential-Size Deterministic Zielonka Automata
• Notes on finite asynchronous automata
• Mathematical Foundations of Computer Science 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Distributed Asynchronous Automata