An algorithm for computing asynchronous automata in the case of acyclic non-commutation graphs
14th International Colloquium on Automata, languages and programming
Safe executions of recognizable trace languages by asynchronous automata
Logic at Botik'89 Symposium on logical foundations of computer science
Asynchronous mappings and asynchronous cellular automata
Information and Computation
The Book of Traces
Determinizing Asynchronous Automata
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Synthesizing Distributed Finite-State Systems from MSCs
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Keeping track of the latest gossip in a distributed system
Distributed Computing
Distributed Asynchronous Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
A theory of regular MSC languages
Information and Computation
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Information and Computation
Constructing exponential-size deterministic zielonka automata
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Taming distributed asynchronous systems
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Compositional synthesis of asynchronous automata
Theoretical Computer Science
Asynchronous games over tree architectures
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Note: A quadratic construction for Zielonka automata with acyclic communication structure
Theoretical Computer Science
| Hi-index | 0.00 |
Asynchronous automata are parallel compositions of finitestate processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trace language can be represented by a deterministic asynchronous automaton. In this paper we improve the construction, in that the size of the obtained asynchronous automaton is polynomial in the size of a given DFA and simply exponential in the number of processes. We show that our construction is optimal within the class of automata produced by Zielonka-type constructions. In particular, we provide the first non trivial lower bound on the size of asynchronous automata.