Optimal Zielonka-type construction of deterministic asynchronous automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6199 LNCS, Issue PART 2, 2010, Pages 52-63

  Genest, Blaise ^a,b   Gimbert, Hugo ^c   Muscholl, Anca ^c   Walukiewicz, Igor ^c  

^a INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

^b UNIVERSITÉ DE RENNES 1   (France)

^c UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ASYNCHRONOUS AUTOMATA; FINITE-STATE PROCESS; LOWER BOUNDS; NON-TRIVIAL; PARALLEL COMPOSITION; SHARED VARIABLES;

LINGUISTICS; OPTIMIZATION; QUERY LANGUAGES; ROBOTS; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 77955313152     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14162-1_5     Document Type: Conference Paper

References (16)

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)
2. Cori, R., Métivier, Y., Zielonka, W.: Asynchronous mappings and asynchronous cellular automata. Information and Computation 106, 159-202 (1993)
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)
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)
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)
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)
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)
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)
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)
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)
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)