Fly-automata for checking MSO 2 graph properties

A more descriptive but too long title would be : Constructing fly-automata to check properties of graphs of bounded tree-width expressed by monadic second-order formulas written with edge quantifications. Such properties are called MSO2 in short. Fly-automata (FA) run bottom-up on terms denoting graphs and compute "on the fly" the necessary states and transitions instead of looking into huge, actually unimplementable tables. In previous works, we have constructed FA that process terms denoting graphs of bounded clique-width, in order to check their monadic second-order (MSO) properties (expressed by formulas without edge quan-tifications). Here, we adapt these FA to incidence graphs, so that they can check MSO2 properties of graphs of bounded tree-width. This is possible because: (1) an MSO2 property of a graph is nothing but an MSO property of its incidence graph and (2) the clique-width of the incidence graph of a graph is linearly bounded in terms of its tree-width. Our constructions are actually implementable and usable. We detail concrete constructions of automata in this perspective.

[1]  Joachim Kneis,et al.  Courcelle's theorem - A game-theoretic approach , 2011, Discret. Optim..

[2]  Michael R. Fellows,et al.  Review of: Fundamentals of Parameterized Complexity by Rodney G. Downey and Michael R. Fellows , 2015, SIGA.

[3]  Bruno Courcelle,et al.  Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach , 2012, Encyclopedia of mathematics and its applications.

[4]  Tom Bouvier,et al.  Graphes et décompositions , 2014 .

[5]  Alexander Langer,et al.  Practical algorithms for MSO model-checking on tree-decomposable graphs , 2014, Comput. Sci. Rev..

[6]  Petr A. Golovach,et al.  Algorithmic lower bounds for problems parameterized by clique-width , 2010, SODA '10.

[7]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[8]  Bruno Courcelle,et al.  From tree-decompositions to clique-width terms , 2017, Discret. Appl. Math..

[9]  Bruno Courcelle,et al.  Fly-Automata, Their Properties and Applications , 2011, CIAA.

[10]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[11]  Bruno Courcelle,et al.  Computations by fly-automata beyond monadic second-order logic , 2013, Theor. Comput. Sci..

[12]  Bruno Courcelle.  Clique-width and tree-width of sparse graphs , 2015 .

[13]  Bruno Courcelle,et al.  Fly-automata, model-checking and recognizability , 2014, ArXiv.

[14]  Martin Grohe,et al.  The complexity of first-order and monadic second-order logic revisited , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[15]  Bruno Courcelle,et al.  On the model-checking of monadic second-order formulas with edge set quantifications , 2012, Discret. Appl. Math..

[16]  Martin Grohe,et al.  The complexity of first-order and monadic second-order logic revisited , 2004, Ann. Pure Appl. Log..

[17]  Bruno Courcelle,et al.  Automata for the verification of monadic second-order graph properties , 2012, J. Appl. Log..

[18]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[19]  Bruno Courcelle,et al.  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width , 1998, WG.

[20]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[21]  Egon Wanke,et al.  The Tree-Width of Clique-Width Bounded Graphs Without Kn, n , 2000, WG.