Article

Optimal Zielonka-type construction of deterministic asynchronous automata

Authors:

Igor WalukiewiczAuthors Info & Claims

ICALP'10: Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II

Pages 52 - 63

Published: 06 July 2010 Publication History

Abstract

Asynchronous automata are parallel compositions of finitestate processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trace language can be represented by a deterministic asynchronous automaton. In this paper we improve the construction, in that the size of the obtained asynchronous automaton is polynomial in the size of a given DFA and simply exponential in the number of processes. We show that our construction is optimal within the class of automata produced by Zielonka-type constructions. In particular, we provide the first non trivial lower bound on the size of asynchronous automata.

References

[1]

Baudru, N.: Distributed Asynchronous Automata. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009 - Concurrency Theory. LNCS, vol. 5710, pp. 115-130. Springer, Heidelberg (2009).

Digital Library

[2]

Cori, R., Métivier, Y., Zielonka, W.: Asynchronous mappings and asynchronous cellular automata. Information and Computation 106, 159-202 (1993).

Digital Library

[3]

Diekert, V., Muscholl, A.: Construction of asynchronous automata. In: Diekert, Rozenberg (eds.) {4}, pp. 249-267.

[4]

Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995).

Digital Library

[5]

Genest, B., Kuske, D., Muscholl, A.: A Kleene theorem and model checking algorithms for existentially bounded communicating automata. Inf. Comput. 204(6), 920-956 (2006).

Digital Library

[6]

Genest, B., Muscholl, A.: Constructing Exponential-Size Deterministic Zielonka Automata. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 565-576. Springer, Heidelberg (2006).

Digital Library

[7]

Henriksen, J.G., Mukund, M., Kumar, K.N., Sohoni, M., Thiagarajan, P.S.: A Theory of Regular MSC Languages. Inf. Comput. 202(1), 1-38 (2005).

Digital Library

[8]

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).

Digital Library

[9]

Mazurkiewicz, A.: Concurrent Program Schemes and their Interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus (1977).

[10]

Métivier, Y.: An algorithm for computing asynchronous automata in the case of acyclic non-commutation graph. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol. 267, pp. 226-236. Springer, Heidelberg (1987).

Digital Library

[11]

Mukund, M., Kumar, K.N., Sohoni, M.: Synthesizing distributed finite-state systems from MSCs. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 521-535. Springer, Heidelberg (2000).

Digital Library

[12]

Mukund, M., Sohoni, M.: Gossiping, Asynchronous Automata and Zielonka's Theorem. Report TCS-94-2, School of Mathematics, SPIC Science Foundation, Madras, India (1994).

[13]

Mukund, M., Sohoni, M.A.: Keeping Track of the Latest Gossip in a Distributed System. Distributed Computing 10(3), 137-148 (1997).

Digital Library

[14]

Stefanescu, A.: Automatic synthesis of distributed transition systems. PhD thesis, Universität Stuttgart (2006).

[15]

Zielonka, W.: Notes on finite asynchronous automata. RAIRO-Theoretical Informatics and Applications 21, 99-135 (1987).

[16]

Zielonka, W.: Safe executions of recognizable trace languages by asynchronous automata. In: Meyer, A.R., Taitslin, M.A. (eds.) Logic at Botik 1989. LNCS, vol. 363, pp. 278-289. Springer, Heidelberg (1989).

Digital Library

Cited By

Bollig BGrindei MHabermehl P(2018)Realizability of concurrent recursive programsFormal Methods in System Design10.1007/s10703-017-0282-y53:3(339-362)Online publication date: 1-Dec-2018
https://dl.acm.org/doi/10.1007/s10703-017-0282-y
Muscholl A(2015)Automated Synthesis of Distributed ControllersProceedings, Part II, of the 42nd International Colloquium on Automata, Languages, and Programming - Volume 913510.1007/978-3-662-47666-6_2(11-27)Online publication date: 6-Jul-2015
https://dl.acm.org/doi/10.1007/978-3-662-47666-6_2
Muscholl A(2010)Taming distributed asynchronous systemsProceedings of the 21st international conference on Concurrency theory10.5555/1887654.1887658(40-47)Online publication date: 31-Aug-2010
https://dl.acm.org/doi/10.5555/1887654.1887658

Recommendations

Constructing exponential-size deterministic zielonka automata
ICALP'06: Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II

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 ...
Quantum versus deterministic counter automata

This paper focuses on quantum analogues of various models of counter automata, and almost completely proves the relation between the classes of languages recognizable by bounded error quantum ones and classical deterministic ones in every model of ...
Strictly deterministic CD-systems of restarting automata
FCT'07: Proceedings of the 16th international conference on Fundamentals of Computation Theory

A CD-system of restarting automata is called strictly deterministic if all its component systems are deterministic, and if there is a unique successor system for each component. Here we show that the strictly deterministic CD-systems of restarting ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

ICALP'10: Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II

July 2010

614 pages

ISBN:3642141617

Editors:
Samson Abramsky
Oxford University Computing Laboratory, Oxford, UK
,
Cyril Gavoille
Université de Bordeaux, LaBRI & INRIA, Talence Cedex, France
,
Claude Kirchner
INRIA, Centre de Recherche Bordeaux - Sud-Ouest, Talence Cedex, France
,
Friedhelm Meyer auf der Heide
Heinz Nixdorf Institute, University of Paderborn, Paderborn, Germany
,
Paul G. Spirakis
University of Patras and RACTI, Patras, Greece

Sponsors

GDR Informatique Mathématique
CNRS: Centre National De La Rechercue Scientifique
Communauté Urbaine de Bordeaux
Conseil Rgional d'Aquitaine
INRIA: Institut Natl de Recherche en Info et en Automatique

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 06 July 2010

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Bollig BGrindei MHabermehl P(2018)Realizability of concurrent recursive programsFormal Methods in System Design10.1007/s10703-017-0282-y53:3(339-362)Online publication date: 1-Dec-2018
https://dl.acm.org/doi/10.1007/s10703-017-0282-y
Muscholl A(2015)Automated Synthesis of Distributed ControllersProceedings, Part II, of the 42nd International Colloquium on Automata, Languages, and Programming - Volume 913510.1007/978-3-662-47666-6_2(11-27)Online publication date: 6-Jul-2015
https://dl.acm.org/doi/10.1007/978-3-662-47666-6_2
Muscholl A(2010)Taming distributed asynchronous systemsProceedings of the 21st international conference on Concurrency theory10.5555/1887654.1887658(40-47)Online publication date: 31-Aug-2010
https://dl.acm.org/doi/10.5555/1887654.1887658

View Options

View options

Figures

Tables

Media

View Table of Conten