Constructing Infinite Graphs with a Decidable MSO-Theory

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.

[1]  Michal P. Chytil,et al.  Mathematical Foundations of Computer Science 1984 , 1984, Lecture Notes in Computer Science.

[2]  Achim Blumensath.  Axiomatising Tree-Interpretable Structures , 2002, STACS.

[3]  Thomas Wilke,et al.  Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.

[4]  Dietmar Berwanger,et al.  The Monadic Theory of Tree-like Structures , 2001, Automata, Logics, and Infinite Games.

[5]  Thierry Cachat,et al.  Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games , 2003, ICALP.

[6]  Werner Damm,et al.  The IO- and OI-Hierarchies , 1982, Theor. Comput. Sci..

[7]  Patrícia Duarte de Lima Machado,et al.  Unit Testing for CASL Architectural Specifications , 2002, MFCS.

[8]  David E. Muller,et al.  The Theory of Ends, Pushdown Automata, and Second-Order Logic , 1985, Theor. Comput. Sci..

[9]  Olivier Carton,et al.  The Monadic Theory of Morphic Infinite Words and Generalizations , 2002, Inf. Comput..

[10]  Felix Klaedtke,et al.  Monadic Second-Order Logics with Cardinalities , 2003, ICALP.

[11]  Alexei L. Semenov,et al.  Decidability of Monadic Theories , 1984, MFCS.

[12]  Christof Löding.  Ground Tree Rewriting Graphs of Bounded Tree Width , 2002, STACS.

[13]  Igor Walukiewicz.  Monadic second-order logic on tree-like structures , 2002, Theor. Comput. Sci..

[14]  M. Leucker.  Prefix-recognizable graphs and monadic second order logic , 2001 .

[15]  Angelo Montanari,et al.  Extending Kamp's Theorem to Model Time Granularity , 2002, J. Log. Comput..

[16]  Bruno Courcelle,et al.  Monadic Second-Order Logic, Graph Coverings and Unfoldings of Transition Systems , 1998, Ann. Pure Appl. Log..

[17]  Mogens Nielsen,et al.  Mathematical Foundations of Computer Science 2000 , 2001, Lecture Notes in Computer Science.

[18]  Didier Caucal.  On Infinite Terms Having a Decidable Monadic Theory , 2002, MFCS.

[19]  Calvin C. Elgot,et al.  Decidability and undecidability of extensions of second (first) order theory of (generalized) successor , 1966, Journal of Symbolic Logic.

[20]  Pawel Urzyczyn,et al.  Higher-Order Pushdown Trees Are Easy , 2002, FoSSaCS.

[21]  Wolfgang Thomas,et al.  A Short Introduction to Infinite Automata , 2001, Developments in Language Theory.

[22]  M. Rabin.  Decidability of second-order theories and automata on infinite trees. , 1969 .

[23]  Didier Caucal.  On infinite transition graphs having a decidable monadic theory , 2003, Theor. Comput. Sci..

[24]  Bruno Courcelle,et al.  Monadic Second-Order Definable Graph Transductions: A Survey , 1994, Theor. Comput. Sci..

[25]  Joseph R. Shoenfield,et al.  Mathematical logic , 1967 .

[26]  Achim Blumensath.  Prefix-Recognisable Graphs and Monadic Second-Order Logic , 2001 .

[27]  Grzegorz Rozenberg,et al.  Developments in Language Theory II , 2002 .

[28]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs IX: Machines and their Behaviours , 1995, Theor. Comput. Sci..

[29]  Pawel Urzyczyn,et al.  Deciding Monadic Theories of Hyperalgebraic Trees , 2001, TLCA.

[30]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.