Distributed Asynchronous Automata

DOI10.1007/978-3-642-04081-8_9MaRDI QIDQ3184669zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Compositional synthesis of asynchronous automata
• scientific article; zbMATH DE number 17820
• scientific article; zbMATH DE number 1015097
• Probabilistic asynchronous automata
• Automata on distributed alphabets

Cites work

• scientific article; zbMATH DE number 554484 (Why is no real title available?)
• scientific article; zbMATH DE number 2087498 (Why is no real title available?)
• scientific article; zbMATH DE number 871239 (Why is no real title available?)
• A Kleene theorem and model checking algorithms for existentially bounded communicating automata
• A theory of regular MSC languages
• Asynchronous mappings and asynchronous cellular automata
• Constructing Exponential-Size Deterministic Zielonka Automata
• Determinizing Büchi asynchronous automata
• Mathematical Foundations of Computer Science 2005
• Notes on finite asynchronous automata
• Unfolding Synthesis of Asynchronous Automata

Cited in

(19)

• A quadratic construction for Zielonka automata with acyclic communication structure
• 2-asynchronous automata
• Distributed ω-Automata
• Compositional synthesis of asynchronous automata
• scientific article; zbMATH DE number 2050928 (Why is no real title available?)
• Determinizing Büchi asynchronous automata
• Automata on distributed alphabets
• Synthesis of distributed algorithms using asynchronous automata.
• scientific article; zbMATH DE number 17820 (Why is no real title available?)
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Asynchronous trace-matching automata
• Asynchronous distributed automata: a characterization of the modal \(\mu\)-fragment
• Cooperating Distributed Tree Automata
• Distributed Time-Asynchronous Automata
• Efficient trace encodings of bounded synthesis for asynchronous distributed systems
• Unfolding Synthesis of Asynchronous Automata
• On distributed monitoring of asynchronous systems
• scientific article; zbMATH DE number 3995056 (Why is no real title available?)
• Optimal Zielonka-type construction of deterministic asynchronous automata

This page was built for publication: Distributed Asynchronous Automata

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