Encyclopedia of Algorithms 2016
DOI: 10.1007/978-1-4939-2864-4_692
|View full text |Cite
|
Sign up to set email alerts
|

Model Checking with Fly-Automata

Abstract: Problem definition 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 ? The proof of the general theorem (an algorithmic meta-theorem, cf. [12]) is based on the description of t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 11 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?