Incremental model checking for decomposable structures

DOI10.1007/3-540-60246-1_159zbMATH Open1193.68164OpenAlexW1583334139MaRDI QIDQ3569044FDOQ3569044

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

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

Mathematics Subject Classification ID

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

Cited In (10)

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

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)