Model Checking with Fly-Automata

Bruno Courcelle (1, 2) , Irène Durand (1, 2)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 Méthodes Formelles

The verification of monadic second-order (MSO) graph properties, equivalently, the model-checking problem for MSO logic over finite binary relational structures , is fixed-parameter tractable (FPT) for the parameter consisting of the formula that expresses the property and the tree-width or the clique-width of the input graph or structure. How to build usable algorithms for this problem ? We use for that fly-automata : the input is a term that describes the graph and the automaton computes, for each term, the necessary transitions and only these ones.

Mots clés: Model-checking; monadic second-order logic; tree-width; clique-width; fixed parameter tractable algorithm; automaton on terms; fly-automaton

Domaines: Logique en informatique [cs.LO]

Bruno Courcelle, Irène Durand. Model Checking with Fly-Automata. Ming-Yang Kao Encyclopedia of Algorithms, second edition., Chapitre 20, 2015, 978-3-642-27848-8. ⟨10.1007/978-3-642-27848-8_692-1⟩. ⟨hal-01299432⟩