Skip to main content
SpringerLink
Log in

Constructing Infinite Graphs with a Decidable MSO-Theory

  • Conference paper
Mathematical Foundations of Computer Science 2003 (MFCS 2003)

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

Abstract

This introductory paper reports on recent progress in the search for classes of infinite graphs where interesting model-checking problems are decidable. We consider properties expressible in monadic second-order logic (MSO-logic), a formalism which encompasses standard temporal logics and the modal μ-calculus. We discuss a class of infinite graphs proposed by D. Caucal (in MFCS 2002) which can be generated from the infinite binary tree by applying the two processes of MSO-interpretation and of unfolding. The main purpose of the paper is to give a feeling for the rich landscape of infinite structures in this class and to point to some questions which deserve further study.

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. Berwanger, D., Blumensath, A.: The monadic theory of tree-like structures. In: [16], 285–302

    Google Scholar 

  2. Blumensath, A.: Preix-recognizable graphs and monadic second-order logic, Rep. AIB-06-2001, RWTH Aachen (2001)

    Google Scholar 

  3. Blumensath, A.: Axiomatising tree-interpretable structures. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 596–607. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Caucal, D.: On infinite transition graphs having a decidable monadic theory. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 194–205. Springer, Heidelberg (1996); Full version in: Theor. Comput. Sci. 290, 79–115 (2003)

    Google Scholar 

  5. Caucal, D.: On infinite graphs having a decidable monadic theory. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420, pp. 165–176. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. Cachat, Th.: Higher order pushdown automata, the Caucal Hierarchy of graphs and parity games. In: Proc. 30th ICALP Springer LNCS (2003) (to appear)

    Google Scholar 

  7. Carton, O., Thomas, W.: The monadic theory of morphic ininite words and generalizations. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 275–284. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  8. Courcelle, B.: Monadic second-order graph transductions: a survey. Theor. Comput. Sci. 126, 53–75 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  9. Courcelle, B.: The monadic second-order logic of graphs IX: machines and their behaviours. Theor. Comput. Sci. 151, 125–162 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  10. Carayol, A., Whrle, S.: Personal communication

    Google Scholar 

  11. Courcelle, B., Walukiewicz, I.: Monadic second-order logic, graph coverings and unfoldings of transition systems. Ann. Pure Appl. Logic 92, 35–62 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  12. Damm, W.: The IO and OI hierarchies. Theor. Comput. Sci. 20, 95–208 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  13. Ebbinghaus, H.D., Flum, J., Thomas, W.: Mathematical Logic. Springer, Heidelberg (1984)

    MATH  Google Scholar 

  14. Elgot, C.C., Rabin, M.O.: Decidability and undecidability of extensions of second (irst) order theory of (generalized) successor. J. Symb. Logic 31, 169–181 (1966)

    Article  MATH  Google Scholar 

  15. Fratani, S., Sénizergues, G.: Personal communication

    Google Scholar 

  16. Grdel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002)

    Google Scholar 

  17. Knapik, T., Niwinski, D., Urzyczyn, P.: Deciding monadic theories of hyperalgebraic trees. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol. 2044, pp. 253–267. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  18. Knapik, T., Niwinski, D., Urzyczyn, P.: Higher-order pushdown trees are easy. In: Nielsen, M., Engberg, U. (eds.) Proc. 5th FoSSaCS. LNCS, vol. 2303, pp. 205–222. Springer, Heidelberg (2002)

    Google Scholar 

  19. Klaedtke, F., Rue, H.: Monadic second-order logic with cardinalities. In: Proc. 30th ICALP 2003, Springer LNCS (to appear) (2003)

    Google Scholar 

  20. Löding, C.: Ground tree rewriting graphs of bounded tree width. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 559–570. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  21. Montanari, A., Peron, A., Policriti, A.: Extending Kamp’s Theorem to model time granularity. J. Logic Computat. 12, 641–678 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  22. Muller, D., Schupp, P.: The theory of ends, pushdown automata, and second-order logic. Theor. Comput. Sci. 37, 51–75 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  23. Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141, 1–35 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  24. Semenov, A.: Decidability of monadic theories. In: Chytil, M.P., Koubek, V. (eds.) MFCS 1984. LNCS, vol. 176, pp. 162–175. Springer, Heidelberg (1984)

    Chapter  Google Scholar 

  25. Thomas, W.: A short introduction to infinite automata. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol. 2295, pp. 130–144. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  26. Walukiewicz, I.: Monadic second-order logic on tree-like structures. Theor. Comput. Sci. 275, 311–346 (2002)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. RWTH Aachen, Lehrstuhl für Informatik VII, D-52056, Aachen, Germany

    Wolfgang Thomas

Authors
  1. Wolfgang Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Comenius University, Mlynská dolina, 842 48, Bratislava, Slovakia

    Branislav Rovan

  2. Charles University, Prague, Czech Republic

    Peter Vojtáš

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Thomas, W. (2003). Constructing Infinite Graphs with a Decidable MSO-Theory. In: Rovan, B., Vojtáš, P. (eds) Mathematical Foundations of Computer Science 2003. MFCS 2003. Lecture Notes in Computer Science, vol 2747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45138-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45138-9_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40671-6

  • Online ISBN: 978-3-540-45138-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation