Skip to main content
SpringerLink
Log in

Asynchronous cellular automata and asynchronous automata for pomsets

  • Conference paper
  • First Online:
CONCUR'98 Concurrency Theory (CONCUR 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1466))

Included in the following conference series:

Abstract

Asynchronous cellular automata and asynchronous automata have been introduced by Zielonka [14] for the study of Mazurkiewicz traces. In [2] Droste & Gastin generalized the first to pomsets. We show that the expressiveness of monadic second order logic and asynchronous cellular automata are different in the class of all pomsets without auto-concurrency. Then we introduce a class where the expressivenesses coincide. This extends the results from [2]. Furthermore, we propose a generalization of trace asynchronous automata for general pomsets. We show that their expressive power coincides with that of monadic second order logic for a large class of pomsets. The universality and the equivalence of asynchronous automata for pomsets are proved to be decidable which is shown to be false for asynchronous cellular automata.

Supported by the German Research Foundation DFG.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. Diekert, A. Muscholl: Construction of asynchronous automata. Chapter 8 of [3].

    Google Scholar 

  2. M. Droste, P. Gastin: Asynchronous cellular automata and logic for pomsets without auto-concurrency. To appear, 1997. Extended abstract appeared as Asynchronous cellular automata for pomsets without auto-concurrency. In: CONCUR 96. Lecture Notes in Computer Science 1119, pp. 627–638, 1996.

    Google Scholar 

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

    Google Scholar 

  4. J.L. Gischer: The equational theory of pomsets. Theoretical Computer Science 61 (1988), pp. 199–224.

    Article  MATH  MathSciNet  Google Scholar 

  5. N. Klarlund, M. Mukund, M. A. Sohoni: Determinizing asynchronous automata.In: ICALP'94 (S. Abiteboul, E. Shamir, eds.), Lecture Notes in Computer Science 820, pp. 130–141, 1994.

    Google Scholar 

  6. D. Kuske: Acceptance modes for asynchronous cellular automata for pomsets. http://www.math.tu-dresden.de/~kuske/abstracts/aca.html, 1997.

    Google Scholar 

  7. A. Mazurkiewicz: Concurrent program schemes and their interpretation. Tech. rep. DAIMI PB 78, Aarhus University, 1977.

    Google Scholar 

  8. A. Mazurkiewicz: Trace Theory. In: Advances in Petri Nets 86 (W. Brauer et al., eds.), Lecture Notes in Computer Science 255, pp. 279–324, 1987.

    Google Scholar 

  9. O. Matz, W. Thomas: The monadic quantifier alternation hierarchy over graphs is infinite. In: Proc. LICS 1997, pp. 236–244.

    Google Scholar 

  10. V.R. Pratt: Modelling concurrency with partial orders. J. of Parallel Programming 15 (1987), pp. 33–71.

    Article  MathSciNet  Google Scholar 

  11. W. Thomas: On logical definability of trace languages. In: Proc. of the workshop Algebraic Methods in Computer Science, Kochel am See, FRG (1989) (V. Diekert, ed.). Report TUM-I9002, TU Munich, 1990, pp. 172–182.

    Google Scholar 

  12. W. Thomas: Languages, Automata, and Logic. In: Handbook of Formal Languages (G. Rozenberg, A. Salomaa, eds.) Springer Verlag (to appeal). For a preliminary version see: Rep. 9607, Inst. f. Informatik u. Prakt. Math., Universität Kiel, 1996.

    Google Scholar 

  13. W. Thomas: Automata theory on trees and partial orders. In: TAPSOFT 97 (M. Bidoit, M. Dauchet, eds.), Lecture Notes in Computer Science 1214, pp. 20–38, 1997.

    Google Scholar 

  14. W. Zielonka: Notes on finite asynchronous automata. R.A.I.R.O. — Informatique Théorique et Applications 21 (1987), pp. 99–135.

    MATH  MathSciNet  Google Scholar 

  15. W. Zielonka: Safe executions of recognizable trace languages by asynchronous automata. In: Logical Foundations of Computer Science (A.R. Meyer et al., eds.), Lecture Notes in Computer Science 363, pp. 278–289, 1989.

    Google Scholar 

  16. W. Zielonka: Asynchronous automata. Chapter 7 of [3].

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Algebra, Technische Universität Dresden, D-01099, Dresden

    Dietrich Kuske

Authors
  1. Dietrich Kuske
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Davide Sangiorgi Robert de Simone

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kuske, D. (1998). Asynchronous cellular automata and asynchronous automata for pomsets. In: Sangiorgi, D., de Simone, R. (eds) CONCUR'98 Concurrency Theory. CONCUR 1998. Lecture Notes in Computer Science, vol 1466. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055645

Download citation

  • DOI: https://doi.org/10.1007/BFb0055645

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64896-3

  • Online ISBN: 978-3-540-68455-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation