Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 2005: Mathematical Foundations of Computer Science 2005 pp 686–698Cite as

Concurrent Automata vs. Asynchronous Systems

  • Conference paper

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

Abstract

We compare the expressive power of two automata-based finite-state models of concurrency. We show that Droste’s and Kuske’s coherent stably concurrent automata and Bednarczyk’s forward-stable asynchronous systems describe the same class of regular event structures. This connection subsumes a previous study by Schmitt which relates Stark’s trace automata to asynchronous systems. This work relies on Zielonka’s theorem and some unrecognized result due to Arnold.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arnold, A.: An extension of the notion of traces and asynchronous automata. RAIRO, Theoretical Informatics and Applications 25, 355–393 (1991) (Gauthiers-Villars)

    MATH  Google Scholar 

  2. Bednarczyk, M.A.: Categories of Asynchronous Systems. PhD thesis in Computer Science University of Sussex (1988)

    Google Scholar 

  3. Bracho, F., Droste, M., Kuske, D.: Representations of computations in concurrent automata by dependence orders. Theoretical Computer Science 174, 67–96 (1997)

    Article  MATH  MathSciNet  Google Scholar 

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

    Book  Google Scholar 

  5. Droste, M.: Concurrency, automata and domains. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 195–208. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  6. Duboc, C.: Mixed product and asynchronous automata. Theoretical Computer Science 48, 183–199 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  7. Husson J.-Fr.: Modelisation de la causalit´e par des relations d’independances. PhD thesis (Universit´e Paul Sabatier de Toulouse (1996)

    Google Scholar 

  8. Kuske, D.: Nondeterministic automata with concurrency relations and domains. In: Tison, S. (ed.) CAAP 1994. LNCS, vol. 787, pp. 202–217. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  9. Mazurkiewicz, A.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 255, pp. 279–324. Springer, Heidelberg (1987)

    Google Scholar 

  10. Mukund, M.: From global specifications to distributed implementations. In: Synthesis and Control of Discrete Event Systems, pp. 19–34. Kluwer, Dordrecht (2002)

    Google Scholar 

  11. Nielsen, M., Thiagarajan, P.S.: Regular event structures and finite petri nets: The conflict-free case. In: Esparza, J., Lakos, C.A. (eds.) ICATPN 2002. LNCS, vol. 2360, pp. 335–351. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  12. Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures and domains I. Theoretical Computer Science 13, 86–108 (1980)

    MathSciNet  Google Scholar 

  13. Sassone, V., Nielsen, M., Winskel, G.: Deterministic Behavioural Models for Concurrency (Extended Abstract). In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol. 711, pp. 682–692. Springer, Heidelberg (1993)

    Google Scholar 

  14. Schmitt, V.: Stable trace automata vs. full trace automata. Theoretical Computer Science 200, 45–100 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  15. Stark, E.W.: Connections between a Concrete and an Abstract Model of Concurrent Systems. In: Schmidt, D.A., Main, M.G., Melton, A.C., Mislove, M.W. (eds.) MFPS 1989. LNCS, vol. 442, pp. 53–79. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  16. Ştefănescu, A., Esparza, J., Muscholl, A.: Synthesis of distributed algorithms using asynchronous automata. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 20–34. Springer, Heidelberg (2003)

    Google Scholar 

  17. Szpilrajn, E.: Sur l’extension de l’ordre partiel. Fund. Math. 16, 386–389 (1930)

    MATH  Google Scholar 

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

  19. Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 255, pp. 325–392. Springer, Heidelberg (1987)

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique Fondamentale de Marseille, 39 rue F. Joliot-Curie, F-13453, Marseille cedex 13, France

    Rémi Morin

Authors
  1. Rémi Morin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics, Gdansk University, Wita Stwosza 57, 80 952, Gdansk, Poland

    Joanna Jȩdrzejowicz  & Andrzej Szepietowski  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Morin, R. (2005). Concurrent Automata vs. Asynchronous Systems. In: Jȩdrzejowicz, J., Szepietowski, A. (eds) Mathematical Foundations of Computer Science 2005. MFCS 2005. Lecture Notes in Computer Science, vol 3618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549345_59

Download citation

  • DOI: https://doi.org/10.1007/11549345_59

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28702-5

  • Online ISBN: 978-3-540-31867-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation