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.
Type de document :
Communication dans un congrès
International Conference on AUTOMATA, LANGUAGES AND PROGRAMMING, 2010, France. pp.52-63, 2010
https://hal.archives-ouvertes.fr/hal-00672834
Contributeur : Blaise Genest
<>
Soumis le : mercredi 22 février 2012 - 10:22:13
Dernière modification le : vendredi 15 février 2019 - 14:46:10
Document(s) archivé(s) le : jeudi 14 juin 2012 - 16:45:26
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, 2010. 〈hal-00672834〉
