Unfolding synthesis of asynchronous automata

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Baudru, N., & Morin, R. (2006). Unfolding synthesis of asynchronous automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3967 LNCS, pp. 46–57). Springer Verlag. https://doi.org/10.1007/11753728_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free