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]
Synthesizing Distributed Finite-State Systems from MSCs
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Categories of asynchronous systems
Categories of asynchronous systems
Concurrent automata vs. asynchronous systems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
A kleene theorem for a class of communicating automata with effective algorithms
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Realizability of Concurrent Recursive Programs
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Distributed Asynchronous Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Compositional synthesis of asynchronous automata
Theoretical Computer Science
Constructing exponential-size deterministic zielonka automata
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
| Hi-index | 0.00 |
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure called an asynchronous automaton. This paper gives a new algorithm for the synthesis of a non-deterministic asynchronous automaton from a regular Mazurkiewicz trace language. Our approach is based on an unfolding procedure that improves the complexity of Zielonka's and Pighizzini's techniques: Our construction is polynomial in terms of the number of states but still double-exponential in the size of the alphabet. As opposed to Métivier's work, our algorithm does not restrict to acyclic dependence alphabets.