Unfolding Synthesis of Asynchronous Automata
Cached
Download Links
- [www.cmi.univ-mrs.fr]
- [www.lif.univ-mrs.fr]
- [www.springerlink.com]
- DBLP
Other Repositories/Bibliography
| Venue: | International Computer Science Symposium in Russia, CSR 2006. Available at http://www.cmi.univ-mrs.fr/˜morin/papers/CSR.pdf |
| Citations: | 2 - 0 self |
BibTeX
@INPROCEEDINGS{Baudru_unfoldingsynthesis,
author = {Nicolas Baudru and Rémi Morin},
title = {Unfolding Synthesis of Asynchronous Automata},
booktitle = {International Computer Science Symposium in Russia, CSR 2006. Available at http://www.cmi.univ-mrs.fr/˜morin/papers/CSR.pdf},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Zielonka’s theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure called an asynchronous automaton. This paper gives a new algorithm for the synthesis of a non-deterministic asynchronous automaton from a regular Mazurkiewicz trace language. Our approach is based on an unfolding procedure that improves the complexity of Zielonka’s and Pighizzini’s techniques: Our construction is polynomial in terms of the number of states but still double-exponential in the size of the alphabet. As opposed to Métivier’s work, our algorithm does not restrict to acyclic dependence alphabets.
