Model Checking with Fly-Automata
Résumé
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.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...