A quadratic construction for Zielonka automata with acyclic communication structure

DOI10.1016/j.tcs.2013.07.015zbMath1360.68566OpenAlexW1988549888MaRDI QIDQ407518

Anca Muscholl, Siddharth Krishna

Publication date: 2 September 2014

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

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

zbMATH Keywords

asynchronous automatadistributed 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)

Related Items (5)

Automated Synthesis of Distributed Controllers ⋮ On Distributed Monitoring and Synthesis ⋮ A PO characterisation of reconfiguration ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asynchronous mappings and asynchronous cellular automata
• Partial (set) 2-structures. II: State spaces of concurrent systems
• Using branching time temporal logic to synthesize synchronization skeletons
• A Kleene theorem and model checking algorithms for existentially bounded communicating automata
• A theory of regular MSC languages
• Distributed Asynchronous Automata
• Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata
• Constructing Exponential-Size Deterministic Zielonka Automata
• Notes on finite asynchronous automata
• Determinizing asynchronous automata
• Keeping track of the latest gossip in a distributed system
• CONCUR 2003 - Concurrency Theory

This page was built for publication: A quadratic construction for Zielonka automata with acyclic communication structure