Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata

Abstract. 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.

• Type: Conference
• Year: 2010
• Where: ICALP
• Authors: Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz
• Keywords: Asynchronous, Asynchronous Automata, Asynchronous Automaton, ICALP 2010, Programming Languages