Abstract
The well-known algorithm of Zielonka describes how to transform automatically a sequential automaton into a deterministic asynchronous trace automaton. In this paper, we improve the construction of deterministic asynchronous automata from finite state automaton. Our construction improves the well-known construction in that the size of the asynchronous automaton is simply exponential in both the size of the sequential automaton and the number of processes. In contrast, Zielonka's algorithm gives an asynchronous automaton that is doubly exponential in the number of processes (and simply exponential in the size of the automaton). © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Genest, B., & Muscholl, A. (2006). Constructing exponential-size deterministic zielonka automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4052 LNCS, pp. 565–576). Springer Verlag. https://doi.org/10.1007/11787006_48
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
