Skip to Main content Skip to Navigation

Model Checking with Fly-Automata

Bruno Courcelle 1, 2, * Irène Durand 1, 2
* Corresponding author
2 Méthodes Formelles
LaBRI - Laboratoire Bordelais de Recherche en Informatique
Abstract : 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.
Document type :
Book sections
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download
Contributor : Bruno Courcelle <>
Submitted on : Thursday, April 7, 2016 - 4:15:22 PM
Last modification on : Tuesday, March 17, 2020 - 3:42:13 PM
Document(s) archivé(s) le : Monday, November 14, 2016 - 9:14:30 PM


Files produced by the author(s)




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⟩



Record views


Files downloads