Compositional synthesis of asynchronous automata

DOI10.1016/J.TCS.2011.03.030MaRDI QIDQ551202zbMATH OpenOpenAlexFDO

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

Recommendations

• scientific article; zbMATH DE number 554484
• Automated synthesis of asynchronizations
• Unfolding Synthesis of Asynchronous Automata
• Composition sequences and synchronizing automata
• Representations of commutative asynchronous automata
• Algorithms and Complexity of Automata Synthesis by Asynhcronous Orchestration With Applications to Web Services Composition
• Compositional coordinator synthesis of extended finite automata
• Determinizing asynchronous automata
• Compositional algorithms for LTL synthesis
• A Compositional Method for the Synthesis of Asynchronous Communication Mechanisms

Cites work

• scientific article; zbMATH DE number 4047130 (Why is no real title available?)
• scientific article; zbMATH DE number 4112050 (Why is no real title available?)
• 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 3251424 (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
• Distributed Asynchronous Automata
• Mathematical Foundations of Computer Science 2005
• Notes on finite asynchronous automata
• On the complementation of Büchi asynchronous cellular automata
• Optimal Zielonka-type construction of deterministic asynchronous automata
• Synthesis of distributed algorithms using asynchronous automata.
• The Synthesis Problem of Netcharts
• Unfolding Synthesis of Asynchronous Automata

Cited in

(14)

• scientific article; zbMATH DE number 3880599 (Why is no real title available?)
• Designing and using a single-step functional model of an asynchronous automaton
• scientific article; zbMATH DE number 1670469 (Why is no real title available?)
• Unfolding Synthesis of Asynchronous Automata
• Synthesis of distributed algorithms using asynchronous automata.
• A quadratic construction for Zielonka automata with acyclic communication structure
• Distributed Asynchronous Automata
• Automata on distributed alphabets
• scientific article; zbMATH DE number 554484 (Why is no real title available?)
• Optimal Zielonka-type construction of deterministic asynchronous automata
• Modeling and Programming Asynchronous Automata Networks: The MOCA Approach
• Algorithms and Complexity of Automata Synthesis by Asynhcronous Orchestration With Applications to Web Services Composition
• Aligning the representation and reality of computation with asynchronous logic automata
• Efficient trace encodings of bounded synthesis for asynchronous distributed systems

This page was built for publication: Compositional synthesis of asynchronous automata

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