scientific article; zbMATH DE number 6687767

DOI10.4230/LIPICS.FSTTCS.2013.213MaRDI QIDQ2963915zbMATH OpenFDO

Authors S. Akshay, Ionuţ Dincă, Blaise Genest, Alin Stefanescu

Publication date 21 February 2017

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2013.213

zbMATH Keywords

asynchronous automataimplementabilityZielonka construction

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Realization of automata by asynchronous logical circuits
• Determinizing asynchronous automata
• Automata of asynchronous behaviors
• Asynchronous systems of parallel communicating finite automata
• Aligning the representation and reality of computation with asynchronous logic automata
• scientific article; zbMATH DE number 3911715
• scientific article; zbMATH DE number 3995056
• Automated synthesis of asynchronizations
• Mathematical Foundations of Computer Science 2005
• scientific article; zbMATH DE number 554484

Cited in

(12)

• Designing and using a single-step functional model of an asynchronous automaton
• Realizability of concurrent recursive programs
• On Distributed Monitoring and Synthesis
• Unfolding Synthesis of Asynchronous Automata
• On deciding synchronizability for asynchronously communicating systems
• Automated synthesis of distributed controllers
• Constructing Exponential-Size Deterministic Zielonka Automata
• Determinizing asynchronous automata
• CONCUR 2005 – Concurrency Theory
• Aligning the representation and reality of computation with asynchronous logic automata
• Synthesising asynchronous automata from fair specifications
• From trees to tree-like: distribution and synthesis for asynchronous automata

This page was built for publication:

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