 |
Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata
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 : Wednesday, March 18, 2020 - 5:38:05 PM
Document(s) archivé(s) le : Thursday, June 14, 2012 - 4:45:26 PM
Contributor : Blaise Genest <>
Submitted on : Wednesday, February 22, 2012 - 10:22:13 AM
Last modification on : Wednesday, March 18, 2020 - 5:38:05 PM
Document(s) archivé(s) le : Thursday, June 14, 2012 - 4:45:26 PM
File
icalpfinal.pdf
Files produced by the author(s)
