Skip to main content
SpringerLink
Log in

Distributed Asynchronous Automata

  • Conference paper
CONCUR 2009 - Concurrency Theory (CONCUR 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5710))

Included in the following conference series:

Abstract

Asynchronous automata are a model of communication processes with a distributed control structure, global initializations and global accepting conditions. The well-known theorem of Zielonka states that they recognize exactly the class of regular Mazurkiewicz trace languages. In this paper we study the particular case of distributed asynchronous automata, which require that the initializations and the accepting conditions are distributed as well: every process chooses an initial local state and stops in a final local state independently from each other. We characterize effectively the regular trace languages recognized by these automata. Also, we present an original algorithm to build, if it is possible, a non-deterministic distributed asynchronous automaton that recognizes a given regular trace language. Surprisingly, this algorithm yields a new construction for the more general problem of the synthesis of asynchronous automata from regular trace languages that subsumes all existing ones in terms of space complexity.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Google Scholar 

  2. Baudru, N., Morin, R.: 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)

    Chapter  Google Scholar 

  3. Cori, R., Métivier, Y., Zielonka, W.: Asynchronous mappings and asynchronous cellular automata. Inform. and Comput. 106, 159–202 (1993)

    Article  MathSciNet  MATH  Google Scholar 

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

    Book  Google Scholar 

  5. Diekert, V., Muscholl, A.: Construction of asynchronous automata, ch. 5(4) (1995)

    Google Scholar 

  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)

    Chapter  Google Scholar 

  7. Genest, B., Kuske, D., Muscholl, A.: A Kleene theorem and model checking algorithms for existentially bounded communicating automata. I&C 204, 902–956 (2006)

    MathSciNet  MATH  Google Scholar 

  8. Henriksen, J.G., Mukund, M., Narayan Kumar, K., Sohoni, M., Thiagarajan, P.S.: A Theory of Regular MSC Languages. I&C 202, 1–138 (2005)

    MathSciNet  MATH  Google Scholar 

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

    Chapter  Google Scholar 

  10. McNaughton, R., Yamada, H.: Regular Expressions and State Graphs for Automata J. Symbolic Logic 32, 390–391 (1967)

    Article  Google Scholar 

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

    Chapter  Google Scholar 

  12. Morin, R.: Concurrent Automata vs. Asynchronous Systems. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 686–698. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

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

    Google Scholar 

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

    Chapter  Google Scholar 

  15. Pighizzini, G.: Synthesis of Nondeterministic Asynchronous Automata. Algebra, Logic and Applications 5, 109–126 (1993)

    MathSciNet  MATH  Google Scholar 

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

    Chapter  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique Fondamentale de Marseille, eRISCS group, Aix-Marseille Universités, 163, avenue de Luminy, F-13288, Marseille Cedex 9, France

    Nicolas Baudru

Authors
  1. Nicolas Baudru
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Bologna, Mura A. Zamboni 7, 40127, Bologna, Italy

    Mario Bravetti  & Gianluigi Zavattaro  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baudru, N. (2009). Distributed Asynchronous Automata. In: Bravetti, M., Zavattaro, G. (eds) CONCUR 2009 - Concurrency Theory. CONCUR 2009. Lecture Notes in Computer Science, vol 5710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04081-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04081-8_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04080-1

  • Online ISBN: 978-3-642-04081-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation