Skip to main content
SpringerLink
Log in

Automata and Logics for Concurrent Systems: Five Models in Five Pages

  • Conference paper
  • First Online:
Implementation and Application of Automata (CIAA 2015)

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

Included in the following conference series:

  • 510 Accesses

Abstract

We survey various automata models of concurrent systems and their connection with monadic second-order logic: finite automata, class memory automata, nested-word automata, asynchronous automata, and message-passing automata.

Not including introduction and references.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

References

  1. Aiswarya, C., Gastin, P.: Reasoning about distributed systems: WYSIWYG. In: FSTTCS 2014, Leibniz International Proceedings in Informatics, vol. 29, pp. 11–30. Leibniz-Zentrum für Informatik (2014)

    Google Scholar 

  2. Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56(3), 1–43 (2009)

    Article  MathSciNet  Google Scholar 

  3. Atig, M.F., Bollig, B., Habermehl, P.: Emptiness of multi-pushdown automata Is 2ETIME-complete. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol. 5257, pp. 121–133. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Björklund, H., Schwentick, T.: On notions of regularity for data languages. Theor. Comput. Sci. 411(4–5), 702–715 (2010)

    Article  MATH  Google Scholar 

  5. Bojanczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data words. ACM Trans. Comput. Log. 12(4), 27 (2011)

    Article  MathSciNet  Google Scholar 

  6. Bollig, B.: On the expressive power of \(2\)-stack visibly pushdown automata. Logical Methods in Computer Science 4(4:16), 1–35 (2008)

    Google Scholar 

  7. Bollig, B., Leucker, M.: Message-passing automata are expressively equivalent to EMSO logic. Theor. Comput. Sci. 358(2–3), 150–172 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  8. Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM 30(2), 323–342 (1983)

    Article  MathSciNet  Google Scholar 

  9. Büchi, J.: Weak second order logic and finite automata. Z. Math. Logik, Grundlag. Math. 5, 62–66 (1960)

    Google Scholar 

  10. Cyriac, A., Gastin, P., Naryanan Kumar, K.: MSO decidability of multi-pushdown systems via split-width. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 547–561. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  11. Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Trans. Am. Math. Soci. 98, 21–52 (1961)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  13. Henriksen, J.G., Mukund, M., Narayan, K., Sohoni, M., Thiagarajan, P.S.: A theory of regular MSC languages. Infor. Comput. 202(1), 1–38 (2005)

    Article  Google Scholar 

  14. La Torre, S., Madhusudan, P., Parlato, G.: A robust class of context-sensitive languages. In: LICS 2007, pp. 161–170. IEEE Computer Society Press (2007)

    Google Scholar 

  15. La Torre, S., Madhusudan, P., Parlato, G.: The language theory of bounded context-switching. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 96–107. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  16. La Torre, S., Napoli, M., Parlato, G.: Scope-bounded pushdown languages. In: Shur, A.M., Volkov, M.V. (eds.) DLT 2014. LNCS, vol. 8633, pp. 116–128. Springer, Heidelberg (2014)

    Google Scholar 

  17. La Torre, S., Napoli, M., Parlato, G.: A unifying approach for multistack pushdown automata. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds.) MFCS 2014, Part I. LNCS, vol. 8634, pp. 377–389. Springer, Heidelberg (2014)

    Google Scholar 

  18. Madhusudan, P., Parlato, G.: The tree width of auxiliary storage. In: POPL 2011, pp. 283–294. ACM (2011)

    Google Scholar 

  19. Thomas, W.: On logical definability of trace languages. In: Proceedings of Algebraic and Syntactic Methods in Computer Science (ASMICS), Report TUM-I9002, Technical University of Munich, pp. 172–182 (1990)

    Google Scholar 

  20. Thomas, W.: Elements of an automata theory over partial orders. In: POMIV 1996, vol. 29, DIMACS. AMS (1996)

    Google Scholar 

  21. Thomas, W.: Languages, automata and logic. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages, vol. 3, pp. 389–455. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  22. Trakhtenbrot, B.A.: Finite automata and monadic second order logic. Siberian Math. J. 3, 103–131 (1962); In Russian; English translation in Amer. Math. Soc. Transl. 59, 23–55 (1966)

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LSV, ENS Cachan, CNRS & Inria, Cachan, France

    Benedikt Bollig

Authors
  1. Benedikt Bollig
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Benedikt Bollig .

Editor information

Editors and Affiliations

  1. Umeå University, Umeå, Sweden

    Frank Drewes

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Bollig, B. (2015). Automata and Logics for Concurrent Systems: Five Models in Five Pages. In: Drewes, F. (eds) Implementation and Application of Automata. CIAA 2015. Lecture Notes in Computer Science(), vol 9223. Springer, Cham. https://doi.org/10.1007/978-3-319-22360-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-22360-5_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-22359-9

  • Online ISBN: 978-3-319-22360-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation