Compositional synthesis of asynchronous automata
DOI10.1016/J.TCS.2011.03.030zbMATH Open1216.68186OpenAlexW1998658600MaRDI QIDQ551202FDOQ551202
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
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
automata theoryconcurrencyformal languagesasynchronous automataMazurkiewicz tracesautomatic synthesis
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Mathematical Foundations of Computer Science 2005
- On the complementation of Büchi asynchronous cellular automata
- Notes on finite asynchronous automata
- Title not available (Why is that?)
- Optimal Zielonka-type construction of deterministic asynchronous automata
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata
- A theory of regular MSC languages
- Distributed Asynchronous Automata
- Constructing Exponential-Size Deterministic Zielonka Automata
- Title not available (Why is that?)
- Synthesis of distributed algorithms using asynchronous automata.
- Asynchronous mappings and asynchronous cellular automata
- Determinizing Büchi asynchronous automata
- Unfolding Synthesis of Asynchronous Automata
- The Synthesis Problem of Netcharts
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (14)
- Title not available (Why is that?)
- A quadratic construction for Zielonka automata with acyclic communication structure
- Title not available (Why is that?)
- Algorithms and Complexity of Automata Synthesis by Asynhcronous Orchestration With Applications to Web Services Composition
- Synthesis of distributed algorithms using asynchronous automata.
- Automata on distributed alphabets
- Distributed Asynchronous Automata
- Efficient trace encodings of bounded synthesis for asynchronous distributed systems
- Designing and using a single-step functional model of an asynchronous automaton
- Aligning the representation and reality of computation with asynchronous logic automata
- Title not available (Why is that?)
- Unfolding Synthesis of Asynchronous Automata
- Optimal Zielonka-type construction of deterministic asynchronous automata
- Modeling and Programming Asynchronous Automata Networks: The MOCA Approach
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)
