Model-checking by infinite fly-automata - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Model-checking by infinite fly-automata

Résumé

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 pos- sible 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
Fichier non déposé

Dates et versions

hal-00875114 , version 1 (21-10-2013)

Identifiants

  • HAL Id : hal-00875114 , version 1

Citer

Bruno Courcelle, Irène A. Durand. Model-checking by infinite fly-automata. 5th Conference on Algebraic Informatics, Sep 2013, Porquerolles, France. pp.211-222. ⟨hal-00875114⟩

Collections

CNRS
51 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More