Unfolding Synthesis of Asynchronous Automata

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

• Type: Conference
• Year: 2006
• Where: CSR
• Authors: Nicolas Baudru, Rémi Morin
• Keywords: Asynchronous Automaton, CSR 2006, Mazurkiewicz Trace, Non-deterministic Asynchronous Automaton, Theoretical Computer Science