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).
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Mukund, M., Narayan Kumar, K., Adsul, B., Narayanan, V.: Causal Closure for MSC Languages. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 335–347. Springer, Heidelberg (2005)
Morin, R., Baudru, N.: Unfolding Synthesis of Asynchronous Automata. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol. 3967, pp. 46–57. Springer, Heidelberg (2006), Available at: http://www.cmi.univ-mrs.fr/~morin/papers/CSR.pdf
Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. of the ACM 30(2), 323–342 (1983)
Cori, R., Métivier, Y., Zielonka, W.: Asynchronous Mappings and Asynchronous Cellular Automata. Inf. and Comput. 106(2), 159–202 (1993)
Diekert, V., Rozenberg, G., Muscholl, A. (eds.): The Book of Traces, vol. Chapter 8. World Scientific, Singapore (1995)
Genest, B., Kuske, D., Muscholl, A.: A Kleene Theorem and Model Checking for a Class of Communicating Automata. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 30–48. Springer, Heidelberg (2004)
Henriksen, J.G., Mukund, M., Narayan Kumar, K., Sohoni, M., Thiagarajan, P.S.: A Theory of Regular MSC Languages. Inf. and Comput. 202(1), 1–38 (2005)
Kuske, D.: Regular sets of infinite message sequence charts. Inf. and Comput. 187(1), 80–109 (2003)
Lohrey, M., Muscholl, A.: Bounded MSC communication. Inf. and Comput. 189, 135–263 (2004)
Mazurkiewicz, A.: Concurrent program schemes and their interpretation. Technical report, DAIMI Report PB-78, Aarhus University (1977)
Meenakshi, B., Madhusudan, P.: Beyond Message Sequence Graphs. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol. 2245, pp. 256–267. Springer, Heidelberg (2001)
Mukund, M.: From global specification to local implementations. In: Synthesis and Control of Discrete Event Systems, pp. 19–34. Kluwer, Dordrecht (2002)
Mukund, M., Sohoni, M., Narayan Kumar, K.: 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.: Keeping Track of the Latest Gossip in a Distributed System. Distr. Computing 10(3), 137–148 (1997)
Esparza, J., Muscholl, A., Ştefănescu, A.: Synthesis of Distributed Algorithms Using Asynchronous Automata. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 27–41. Springer, Heidelberg (2003)
Zielonka, W.: Note on finite asynchronous automata. R.A.I.R.O. - Informatique Théorique et Applications 21, 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
Genest, B., Muscholl, A. (2006). Constructing Exponential-Size Deterministic Zielonka Automata. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds) Automata, Languages and Programming. ICALP 2006. Lecture Notes in Computer Science, vol 4052. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11787006_48
Download citation
DOI: https://doi.org/10.1007/11787006_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35907-4
Online ISBN: 978-3-540-35908-1
eBook Packages: Computer ScienceComputer Science (R0)