An algorithm for computing asynchronous automata in the case of acyclic non-commutation graphs
14th International Colloquium on Automata, languages and programming
Synthesis of nondeterministic asynchronous automata
Semantics of programming languages and model theory
Asynchronous mappings and asynchronous cellular automata
Information and Computation
The Book of Traces
On the Complementation of Büchi Asynchronous Cellular Automata
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Determinizing Asynchronous Automata
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Regular Event Structures and Finite Petri Nets: A Conjecture
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
A theory of regular MSC languages
Information and Computation
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Information and Computation
Unfolding synthesis of asynchronous automata
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Constructing exponential-size deterministic zielonka automata
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Concurrent automata vs. asynchronous systems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Optimal Zielonka-type construction of deterministic asynchronous automata
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Compositional synthesis of asynchronous automata
Theoretical Computer Science
Fair Synthesis for Asynchronous Distributed Systems
ACM Transactions on Computational Logic (TOCL)
Note: A quadratic construction for Zielonka automata with acyclic communication structure
Theoretical Computer Science
| Hi-index | 0.00 |
Asynchronous automata are a model of communication processes with a distributed control structure, global initializations and global accepting conditions. The well-known theorem of Zielonka states that they recognize exactly the class of regular Mazurkiewicz trace languages. In this paper we study the particular case of distributed asynchronous automata, which require that the initializations and the accepting conditions are distributed as well: every process chooses an initial local state and stops in a final local state independently from each other. We characterize effectively the regular trace languages recognized by these automata. Also, we present an original algorithm to build, if it is possible, a non-deterministic distributed asynchronous automaton that recognizes a given regular trace language. Surprisingly, this algorithm yields a new construction for the more general problem of the synthesis of asynchronous automata from regular trace languages that subsumes all existing ones in terms of space complexity.