A quadratic construction for Zielonka automata with acyclic communication structure
From MaRDI portal
(Redirected from Publication:407518)
Recommendations
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 1759633 (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 asynchronous automata
- Distributed Asynchronous Automata
- Keeping track of the latest gossip in a distributed system
- Notes on finite asynchronous automata
- Optimal Zielonka-type construction of deterministic asynchronous automata
- Partial (set) 2-structures. II: State spaces of concurrent systems
- Synthesis of distributed algorithms using asynchronous automata.
- Using branching time temporal logic to synthesize synchronization skeletons
Cited in
(9)- A PO characterisation of reconfiguration
- Unfolding Synthesis of Asynchronous Automata
- Constructing Exponential-Size Deterministic Zielonka Automata
- scientific article; zbMATH DE number 7566078 (Why is no real title available?)
- Optimal Zielonka-type construction of deterministic asynchronous automata
- scientific article; zbMATH DE number 4047130 (Why is no real title available?)
- scientific article; zbMATH DE number 7559475 (Why is no real title available?)
- Automated synthesis of distributed controllers
- On Distributed Monitoring and Synthesis
This page was built for publication: A quadratic construction for Zielonka automata with acyclic communication structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q407518)