Model-checking by infinite fly-automata

DOI10.1007/978-3-642-40663-8_20MaRDI QIDQ2850017zbMATH OpenOpenAlexFDO

Authors Irène Durand, Bruno Courcelle

Publication date 20 September 2013

Published in Algebraic Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40663-8_20

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Computations by fly-automata beyond monadic second-order logic
• Automata for the verification of monadic second-order graph properties
• Fly-automata for checking monadic second-order properties of graphs of bounded tree-width
• Fly-automata, their properties and applications
• Fly-automata for checking \(\mathrm{MSO}_2\) graph properties

Cited in

(6)

• Fly-automata for checking \(\mathrm{MSO}_2\) graph properties
• From tree-decompositions to clique-width terms
• Fly-automata for checking monadic second-order properties of graphs of bounded tree-width
• Practical algorithms for MSO model-checking on tree-decomposable graphs
• Computations by fly-automata beyond monadic second-order logic
• Directed NLC-width

This page was built for publication: Model-checking by infinite fly-automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2850017)