Constructing Exponential-Size Deterministic Zielonka Automata

DOI10.1007/11787006_48MaRDI QIDQ3591422zbMATH OpenOpenAlexFDO

Authors Blaise Genest, Anca Muscholl

Publication date 11 September 2007

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11787006_48

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Optimal Zielonka-type construction of deterministic asynchronous automata
• Determinizing asynchronous automata
• A quadratic construction for Zielonka automata with acyclic communication structure
• Determinizing Büchi asynchronous automata
• scientific article; zbMATH DE number 6687767

Cited in

(14)

• Weighted asynchronous cellular automata
• Realizability of concurrent recursive programs
• Distributed Asynchronous Automata
• On Distributed Monitoring and Synthesis
• Automated synthesis of distributed controllers
• Optimal Zielonka-type construction of deterministic asynchronous automata
• Realizability of Concurrent Recursive Programs
• A quadratic construction for Zielonka automata with acyclic communication structure
• Determinizing asynchronous automata
• Compositional synthesis of asynchronous automata
• A Theory of Formal Choreographic Languages
• Adding reconfiguration to Zielonka's asynchronous automata
• Synthesising asynchronous automata from fair specifications
• From trees to tree-like: distribution and synthesis for asynchronous automata

This page was built for publication: Constructing Exponential-Size Deterministic Zielonka Automata

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