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.
Supported by the ANR project SOAPDC.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baudru, N., Morin, R.: Safe Implementability of Regular Message Sequence Charts Specifications. In: Proc. of the ACIS 4th Int. Conf. SNDP, pp. 210–217 (2003)
Baudru, N., Morin, R.: The Synthesis Problem of Netcharts (submitted, 2006)
Bednarczyk, M.A.: Categories of Asynchronous Systems. PhD thesis in Computer Science, University of Sussex (1988)
Cori, R., Métivier, Y., Zielonka, W.: Asynchronous mappings and asynchronous cellular automata. Inform. and Comput. 106, 159–202 (1993)
Diekert, V., Rozenberg, G.: The Book of Traces. World Scientific, Singapore (1995)
Genest, B., Muscholl, A., Kuske, D.: A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 30–48. Springer, Heidelberg (2004)
Genest, B., Muscholl, A.: Constructing Exponential-size Deterministic Zielonka Automata. Technical report, 12 pages (2006)
Klarlund, N., Mukund, M., Sohoni, M.: Determinizing Asynchronous Automata. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol. 820, pp. 130–141. Springer, Heidelberg (1994)
Métivier, Y.: An algorithm for computing asynchronous automata in the case of acyclic noncommutation graph. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol. 267, pp. 226–236. Springer, Heidelberg (1987)
Morin, R.: Concurrent Automata vs. Asynchronous Systems. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 686–698. Springer, Heidelberg (2005)
Mukund, M., Narayan Kumar, K., Sohoni, M.: Synthesizing distributed finite-state systems from MSCs. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 521–535. Springer, Heidelberg (2000)
Mukund, M., Sohoni, M.: Gossiping, Asynchronous Automata and Zielonka’s Theorem. Report TCS-94-2, SPIC Science Foundation, Madras, India (1994)
Muscholl, A.: On the complementation of Büchi asynchronous cellular automata. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol. 820, pp. 142–153. Springer, Heidelberg (1994)
Pighizzini, G.: Synthesis of Nondeterministic Asynchronous Automata. Algebra. Logic and Applications 5, 109–126 (1993)
Ştefănescu, A., Esparza, J., Muscholl, A.: Synthesis of distributed algorithms using asynchronous automata. In: Amadio, R., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 27–41. Springer, Heidelberg (2003)
Thiagarajan, P.S.: Regular Event Structures and Finite Petri Nets: A Conjecture. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol. 2300, pp. 244–256. Springer, Heidelberg (2002)
Zielonka, W.: Notes on finite asynchronous automata. In: RAIRO, Theoretical Informatics and Applications, Gauthiers-Villars, vol. 21, pp. 99–135 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baudru, N., Morin, R. (2006). Unfolding Synthesis of Asynchronous Automata. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds) Computer Science – Theory and Applications. CSR 2006. Lecture Notes in Computer Science, vol 3967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11753728_8
Download citation
DOI: https://doi.org/10.1007/11753728_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34166-6
Online ISBN: 978-3-540-34168-0
eBook Packages: Computer ScienceComputer Science (R0)