Abstract : Asynchronous automata are parallel compositions of finite-state 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.
https://hal.archives-ouvertes.fr/hal-00672834
Contributor : Blaise Genest
<>
Submitted on : Wednesday, February 22, 2012 - 10:22:13 AM
Last modification on : Tuesday, May 14, 2019 - 10:24:16 AM
Long-term archiving on: Thursday, June 14, 2012 - 4:45:26 PM
Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz. Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata. International Conference on AUTOMATA, LANGUAGES AND PROGRAMMING, 2010, France. pp.52-63. ⟨hal-00672834⟩
