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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Berwanger, D., Blumensath, A.: The monadic theory of tree-like structures. In: [16], 285–302
Blumensath, A.: Preix-recognizable graphs and monadic second-order logic, Rep. AIB-06-2001, RWTH Aachen (2001)
Blumensath, A.: Axiomatising tree-interpretable structures. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 596–607. Springer, Heidelberg (2002)
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)
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)
Cachat, Th.: Higher order pushdown automata, the Caucal Hierarchy of graphs and parity games. In: Proc. 30th ICALP Springer LNCS (2003) (to appear)
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)
Courcelle, B.: Monadic second-order graph transductions: a survey. Theor. Comput. Sci. 126, 53–75 (1994)
Courcelle, B.: The monadic second-order logic of graphs IX: machines and their behaviours. Theor. Comput. Sci. 151, 125–162 (1995)
Carayol, A., Whrle, S.: Personal communication
Courcelle, B., Walukiewicz, I.: Monadic second-order logic, graph coverings and unfoldings of transition systems. Ann. Pure Appl. Logic 92, 35–62 (1998)
Damm, W.: The IO and OI hierarchies. Theor. Comput. Sci. 20, 95–208 (1982)
Ebbinghaus, H.D., Flum, J., Thomas, W.: Mathematical Logic. Springer, Heidelberg (1984)
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)
Fratani, S., Sénizergues, G.: Personal communication
Grdel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002)
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)
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)
Klaedtke, F., Rue, H.: Monadic second-order logic with cardinalities. In: Proc. 30th ICALP 2003, Springer LNCS (to appear) (2003)
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)
Montanari, A., Peron, A., Policriti, A.: Extending Kamp’s Theorem to model time granularity. J. Logic Computat. 12, 641–678 (2002)
Muller, D., Schupp, P.: The theory of ends, pushdown automata, and second-order logic. Theor. Comput. Sci. 37, 51–75 (1985)
Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141, 1–35 (1969)
Semenov, A.: Decidability of monadic theories. In: Chytil, M.P., Koubek, V. (eds.) MFCS 1984. LNCS, vol. 176, pp. 162–175. Springer, Heidelberg (1984)
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)
Walukiewicz, I.: Monadic second-order logic on tree-like structures. Theor. Comput. Sci. 275, 311–346 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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