Automata for the verification of monadic second-order graph properties - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Applied Logic Année : 2012

Automata for the verification of monadic second-order graph properties

Résumé

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.
Fichier principal
Vignette du fichier
FlyAutomataFINAL.pdf (738.62 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00611853 , version 1 (27-07-2011)
hal-00611853 , version 2 (03-09-2012)

Identifiants

  • HAL Id : hal-00611853 , version 2

Citer

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

Collections

CNRS
215 Consultations
264 Téléchargements

Partager

Gmail Facebook X LinkedIn More