Fusion in relational structures and the verification of monadic second-order properties

Mathematical Structures in Computer Science

Volumn 12, Issue 2, 2002, Pages 203-235

  Courcelle B ^a,b   Makowsky*,* J A ^a,b  

^a Universite Bordeaux I ^*

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85012926441     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S0960129501003565     Document Type: Article

References (20)

1. Arnborg, S., Lagergren, J. and Seese, D. (1991) Easy problems for tree decomposable graphs. Journal of Algorithms 12 308–340.
2. Bauderon, M. and Courcelle, B. (1987) Graph expressions and Graph rewriting. Mathematical Systems Theory 20 83–127.
3. Corneil, D., Perl, Y. and Stewart, L. K. (1985) A linear recognition algorithm for cographs. SIAM Journal on Computation 14 926–934.
4. Corneil, D. G., Habib, M., Lanlignel, J.-M., Reed, B. and Rotics, U. (2000) Polynomial time recognition of clique-width ≤ 3 graphs. Proceedings LATIN’2000. Springer-Verlag Lecture Notes in Computer Science 1776 126–134.
5. Courcelle, B. (1987) An axiomatic definition of context-free rewriting and its application to NLC grammars. Theoretical Computer Science 55 141–181.
6. Courcelle, B. (1992) Monadic second-order logic of graphs VII: Graphs as relational structures. Theoretical Computer Science 101 3–33.
7. Courcelle, B. (1994) Monadic second order graph transductions: A survey. Theoretical Computer Science 126 53–75,
8. Courcelle, B. (1995) Structural properties of context-free sets of graphs generated by vertex replace-ment. Information and Computation 116 275–293.
9. Courcelle, B. (1997) The expression of graph properties and graph transformations in monadic second-order logic. In: Rozenberg, G. (ed.) Handbook of graph grammars and computing by graph transformations, Vol. 1: Foundations, World Scientific 313–400.
10. Courcelle, B., Engelfriet, J. and Rozenberg, G. (1993) Handle rewriting hypergraph grammars. J. Comput. System Sci. 46 218–246.
11. Courcelle, B. and Engelfriet, J. (1995) A logical characterization of the sets of hypergraphs defined by hyperedge replacement grammars. Mathematical Systems Theory 28 515–552.
12. Courcelle, B., Makowsky, J. A. and Rotics, U. (2000) Linear time solvable optimization problems on graphs of bounded clique-width. Theory of Computing Systems 33 125–150.
13. Courcelle, B. and Mosbah, M. (1993) Monadic second-order evaluations on tree-decomposable graphs. Theoretical Computer Science 109 49–82.
14. Courcelle, B. and Olariu, S. (2000) Upper bounds to the clique-width of graphs. Discrete Applied Mathematics 101 77–114.
15. Courcelle, B. and Walukiewicz, I. (1998) Monadic Second-order logic, graph coverings and unfoldings of transition systems. Annals of Pure and Applied Logic 92 35–62.
16. Downey, R. and Fellows, M. (1997) Parametrized complexity, Springer-Verlag.
17. Drewes, F., Kreowski, H.-J. and Habel, H. (1997) Hyperedge replacement. In: Rozenberg, G. (ed.) Handbook of graph grammars and computing by graph transformations, Vol 1: Foundations, World Scientific 95–162. Engelfriet, J. Graph grammars and tree transducers. Proceedings CAAP’94. Springer-Verlag Lecture Notes in Computer Science 787 15–36.
18. Engelfriet, J. and van Oostrom, V. (1997) Logical description of context-free graph-languages. Journal of Computer and System Sciences 55 489–503.
19. Engelfriet, J. and Rozenberg, G. (1997) Node replacement graph grammars. In: Rozenberg, G. (ed.) Handbook of graph grammars and computing by graph transformations Vol. 1: Foundations, World Scientific 1–94.
20. Thomas, W. (1990) Automata on infinite objects. Handbook of Theoretical Computer Science, vol. 2, Elsevier 133–192.