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
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
Safe Executions of Recognizable Trace Languages by Asynchronous Automata
Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at Botik '89
Regular event structures and finite Petri nets: a conjecture
Formal and natural 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
Optimal Zielonka-type construction of deterministic asynchronous automata
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
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
The synthesis problem of netcharts
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Concurrent automata vs. asynchronous systems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
| Hi-index | 5.23 |
Asynchronous automata are a model of communication processes with a control structure distributed on a set P of processes, global initializations and global accepting conditions. The well-known theorem of Zielonka states that they recognize exactly the class of regular Mazurkiewicz trace languages. The corresponding synthesis problem is, given a global specification A of any regular trace language L, to build an asynchronous automaton that recognizes L, automatically. Yet, all such existing constructions are quite involved and yield an explosion of the number of states in each process, which is exponential in both the sizes of A and P. In this paper, we introduce the particular case of distributed asynchronous automata, which require that the initializations and the accepting conditions are distributed as well. We present an original technique based on simple compositions/decompositions of these distributed asynchronous automata that results in the construction of smaller non-deterministic asynchronous automata: now, the number of states in each process is only polynomial in the size of A, but is still exponential in the size of P.