Constructing Exponential-size Deterministic Zielonka Automata
| Venue: | in "ICALP", vol. LNCS 4052 |
| Citations: | 3 - 0 self |
BibTeX
@INPROCEEDINGS{Genest_constructingexponential-size,
author = {Blaise Genest and Anca Muscholl},
title = {Constructing Exponential-size Deterministic Zielonka Automata},
booktitle = {in "ICALP", vol. LNCS 4052},
year = {},
pages = {565--576}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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). 1
