Compositional synthesis of asynchronous automata

DOI10.1016/j.tcs.2011.03.030zbMath1216.68186OpenAlexW1998658600MaRDI QIDQ551202

Nicolas Baudru

Publication date: 14 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.03.030

zbMATH Keywords

automata theoryformal languagesconcurrencyasynchronous automataMazurkiewicz tracesautomatic synthesis

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Distributed Asynchronous Automata
• Unfolding Synthesis of Asynchronous Automata
• Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata
• Constructing Exponential-Size Deterministic Zielonka Automata
• The Synthesis Problem of Netcharts
• Notes on finite asynchronous automata
• On the complementation of Büchi asynchronous cellular automata
• Mathematical Foundations of Computer Science 2005
• CONCUR 2003 - Concurrency Theory