Constructing infinite graphs with a decidable MSO-theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2747, Issue , 2003, Pages 113-124

  Thomas, Wolfgang ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; CALCULATIONS; COMPUTABILITY AND DECIDABILITY; FORMAL LOGIC; MODEL CHECKING; TEMPORAL LOGIC;

INFINITE GRAPH; MODAL MU CALCULUS; MODEL CHECKING PROBLEM; MONADIC SECOND-ORDER LOGIC; MSO LOGIC; RECENT PROGRESS;

TREES (MATHEMATICS);

EID: 35248863009     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45138-9_6     Document Type: Article

References (27)

1. D. Berwanger, A. Blumensath, The monadic theory of tree-like structures, in [16], pp. 285-302.
2. A. Blumensath, Prefix-recognizable graphs and monadic second-order logic, Rep. AIB-06-2001, RWTH Aachen, 2001.
3. A. Blumensath, Axiomatising tree-interpretable structures, in: Proc. 19th STACS, Springer LNCS 2285 (2002), 596-607.
4. D. Caucal, On infinite transition graphs having a decidable monadic theory, in: Proc. 23rd ICALP (F. Meyer auf der Héide, B. Monien, Eds.), Springer LNCS 1099 (1996), 194-205
5. [Full version in: Theor. Comput. Sci. 290 (2003), 79-115].
6. D. Caucal, On infinite graphs having a decidable monadic theory, in: Proc. 27th MFCS (K. Diks, W. Rytter, Eds.), Springer LNCS 2420 (2002), 165-176.
7. Th. Cachat, Higher order pushdown automata, the Caucal Hierarchy of graphs and parity games, in Proc. 30th ICALP, 2003, Springer LNCS (to appear).
8. O. Carton, W. Thomas, The monadic theory of morphic infinite words and generalizations, in: Proc. 25th MFCS (M. Nielsen, B. Rovan, Eds.), Springer LNCS 1893 (2000), 275-284.
9. B. Courcelle, Monadic second-order graph transductions: a survey, Theor. Comput. Sci. 126 (1994), 53-75.
10. B. Courcelle, The monadic second-order logic of graphs IX: machines and their behaviours, Theor. Comput. Sci. 151 (1995), 125-162.
11. A. Carayol, S. Whrle, personal communication.
12. B. Courcelle, I. Walukiewicz, Monadic second-order logic, graph coverings and unfoldings of transition systems, Ann. Pure Appl. Logic 92 (1998), 35-62.
13. W. Damm, The IO and OI hierarchies, Theor. Comput. Sci. 20 (1982), 95-208.
14. H.D. Ebbinghaus, J. Flum, W. Thomas, Mathematical Logic, Springer, Berlin-Heidelberg-New York 1984.
15. C.C. Elgot, M.O. Rabin, Decidability and undecidability of extensions of second (first) order theory of (generalized) successor, J. Symb. Logic 31 (1966), 169-181.
16. S. Fratani, G. Sénizergues, personal communication.
17. Automata, Logics, and Infinite Games (E. Grdel, W. Thomas, Th. Wilke, Eds.), Springer LNCS 2500 (2002), Springer-Verlag, Berlin-Heidelberg-New York 2002.
18. T. Knapik, D. Niwinski, P. Urzyczyn, Deciding monadic theories of hyperalgebraic trees, in: TCLA 2001 (S. Abramsky, Ed.), Springer LNCS 2044 (2001), 253-267.
19. T. Knapik, D. Niwinski, P. Urzyczyn, Higher-order pushdown trees are easy, in: Proc. 5th FoSSaCS (M. Nielsen, U. Engberg, Eds.), Springer LNCS 2303 (2002), 205-222.
20. F. Klaedtke, H. Rue, Monadic second-order logic with cardinalities, in: Proc. 30th ICALP 2003, Springer LNCS (to appear).
21. C. Löding, Ground tree rewriting graphs of bounded tree width, in: Proc. 19th STACS, Springer LNCS 2285 (2002), 559-570.
22. A. Montanari, A. Peron, A. Policriti, Extending Kamp's Theorem to model time granularity, J. Logic Computat. 12 (2002), 641-678.
23. D. Muller, P. Schupp, The theory of ends, pushdown automata, and second-order logic, Theor. Comput. Sci. 37 (1985), 51-75.
24. M.O. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141 (1969), 1-35.
25. A. Semenov, Decidability of monadic theories, in: Proc. MFCS 1984 (M.P. Chytil, V. Koubek, Eds.), Springer LNCS 176 (1984), 162-175.
26. W. Thomas, A short introduction to infinite automata. In: Proc. 5th International Conference "Developments in Language Theory", Springer LNCS 2295 (2002), 130-144.
27. I. Walukiewicz, Monadic second-order logic on tree-like structures, Theor. Comput. Sci. 275 (2002), 311-346.