Automata for the verification of monadic second-order graph properties

Abstract : The model-checking problem for monadic second-order logic on graphs is fixed-parameter tractable with respect to tree-width and clique-width. The proof constructs finite automata from monadic second-order sentences. These automata recognize the terms over fixed finite signatures that define graphs satisfying the given sentences. However, this construction produces automata of hyper-exponential sizes, and is thus impossible to use in practice in many cases. To overcome this difficulty, we propose to specify the transitions of automata by programs instead of tables. Such automata are called fly-automata. By using them, we can check certain monadic second-order graph properties with limited quantifier alternation depth, that are nevertheless interesting for Graph Theory. We give explicit constructions of automata relative to graphs of bounded clique-width, and we report on experiments.
Type de document :
Article dans une revue
Journal of Applied Logic, Elsevier, 2012, 10, pp.368-409
Liste complète des métadonnées
Contributeur : Bruno Courcelle <>
Soumis le : lundi 3 septembre 2012 - 10:37:25
Dernière modification le : lundi 21 octobre 2013 - 11:24:40
Document(s) archivé(s) le : mardi 4 décembre 2012 - 03:40:45


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00611853, version 2



Bruno Courcelle, Irène Durand. Automata for the verification of monadic second-order graph properties. Journal of Applied Logic, Elsevier, 2012, 10, pp.368-409. <hal-00611853v2>



Consultations de
la notice


Téléchargements du document