Monadic second-order logic, graph coverings and unfoldings of transition systems

Annals of Pure and Applied Logic

Volumn 92, Issue 1, 1998, Pages 35-62

  Courcelle, Bruno ^a   Walukiewicz, Igor ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

Graph covering; Infinite tree; Rabin automaton; Second order logic; Semantics; Transition systems

Indexed keywords

EID: 0032507192     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(97)00048-1     Document Type: Article

References (15)

1. [1] B. Bollobas, Extremal Graph Theory, Academic Press, New York, 1978.
2. [2] B. Courcelle, Monadic second-order graph transductions: a survey, Theoret. Comput. Sci. 126 (1994) 53-75.
3. [3] B. Courcelle, The monadic second-order logic on graphs VI: on several representations of graphs by relational structures, Disc. Appl. Math. 54 (1994) 117-149. (Erratum in Disc. App. Math. 63 (1995) 199-200).
4. [4] B. Courcelle, The monadic second-order logic on graphs IX: machines and behaviours, Theoret. Comput. Sci. 151 (1995) 125-162.
5. [5] B. Courcelle, The expression of graph properties and graph transformations in monadic second-order logic, in: G. Rozenberg (Ed.), Hand-book of Graph Transformations: Foundations, vol. 1, World Scientific, Singapore, 1997, pp. 313-400.
6. [6] E.A. Emerson, C.S. Jutla, Tree automata, mu-calculus and determinacy, Proc. FOCS 91, 1991, pp. 368-377.
7. [7] A.W. Mostowski, Regular expressions for infinite trees and a standard form of automata, in: A. Skowron (Ed.), 5th Symp on Computation Theory, Lecture Notes in Computer Science, vol. 208, 1984, pp. 157-168.
8. [8] A.W. Mostowski, Games with forbidden positions, Technical Report 78, University of Gdansk, 1991.
9. [9] D. Niwiński, Fixed points vs. infinite generation, in LICS '88, 1988, pp. 402-409.
10. [10] M. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141 (1969) 1-35.
11. [11] A. Semenov, Decidability of monadic theories, in MFCS '84, Lecture Notes in Computer Science, vol. 176, Springer, Berlin, 1984, pp. 162-175.
12. [12] S. Shelah, The monadic second-order theory of order, Ann. Math. 102 (1975) 379-419.
13. [13] J. Stupp, The lattice-model is recursive in the original model, Institute of Mathematics, The Hebrew University, Jerusalem, January 1975.
14. [14] W. Thomas, Language, automata and logic, in: Handbook of Formal Language Theory, Vol. 3, Springer, Berlin, Heidelberg, 1997, pp. 389-455.
15. [15] I. Walukiewicz, Monadic second order logic on tree-like structures, STACS '96, Lecture Notes in Computer Science, vol. 1046, 1996, pp. 401-414.