Model-Checking by Infinite Fly-Automata

DOI10.1007/978-3-642-40663-8_20zbMath1398.68336OpenAlexW72138669MaRDI QIDQ2850017

Irène Durand

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

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

Related Items (6)

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

This page was built for publication: Model-Checking by Infinite Fly-Automata