Model-Checking by Infinite Fly-Automata

We present logic based methods for constructing XP and FPT graph algorithms, parameterized by tree-width or clique-width. We will use fly-automata introduced in a previous article. They make it possible to check properties that are not monadic second-order expressible because their states may include counters, so that their set of states may be infinite. We equip these automata with output functions, so that they can compute values associated with terms or graphs. We present tools for constructing easily algorithms by combining predefined automata for basic functions and properties.

[1]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[2]  Michael R. Fellows,et al.  On the Complexity of Some Colorful Problems Parameterized by Treewidth , 2007, COCOA.

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

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

[5]  Bruno Courcelle,et al.  Monadic Second-Order Evaluations on Tree-Decomposable Graphs , 1993, Theor. Comput. Sci..

[6]  Detlef Seese,et al.  Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

[7]  Bruno Courcelle,et al.  Infinite Transducers on Terms Denoting Graphs , 2013, ELS.

[8]  Michael R. Fellows,et al.  On the complexity of some colorful problems parameterized by treewidth , 2011, Inf. Comput..

[9]  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.

[10]  Michaël Rao,et al.  MSOL partitioning problems on graphs of bounded treewidth and clique-width , 2007, Theor. Comput. Sci..

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

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

[13]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

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

[15]  Klaus Reinhardt,et al.  The Complexity of Translating Logic to Finite Automata , 2001, Automata, Logics, and Infinite Games.

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

[17]  Nikolaj Bjørner,et al.  Symbolic Automata: The Toolkit , 2012, TACAS.