Incremental model checking for decomposable structures

DOI10.1007/3-540-60246-1_159MaRDI QIDQ3569044zbMATH OpenOpenAlexFDO

Authors Johann A. Makowsky, E. Ravve

Publication date 17 June 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60246-1_159

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 4180789
• Compositional and quantitative model checking (extended abstract)
• scientific article; zbMATH DE number 910719
• A decidability result for the model checking of infinite-state systems
• Compositional model checking with incremental counter-example construction

Cited in

(10)

• Mathematical Foundations of Computer Science 2004
• A logic-based approach to incremental reasoning on multi-agent systems
• Fixpoint logics over hierarchical structures
• Compositional model checking with incremental counter-example construction
• Algorithmic uses of the Feferman-Vaught theorem
• From natural projection to partial model checking and back
• A formal framework for incremental model slicing
• The monadic theory of finite representations of infinite words
• Compositional failure detection in structured transition systems
• Effective optimization with weighted automata on decomposable trees

This page was built for publication: Incremental model checking for decomposable structures

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