The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Kleene's three valued logics and their children
Fundamenta Informaticae
Model checking
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Generalized Model Checking: Reasoning about Partial State Spaces
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Reducing Model Checking from Multi-valued {\rm CTL}^{\ast} to {\rm CTL}^{\ast}
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Model Checking Partial State Spaces with 3-Valued Temporal Logics
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Model Checking with Multi-Valued Temporal Logics
ISMVL '01 Proceedings of the 31st IEEE International Symposium on Multiple-Valued Logic
Multi-valued symbolic model-checking
ACM Transactions on Software Engineering and Methodology (TOSEM)
CAMA: A Multi-Valued Satisfiability Solver
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Self-Managed Systems: an Architectural Challenge
FOSE '07 2007 Future of Software Engineering
Why waste a perfectly good abstraction?
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
Partial Kripke structures model incomplete state spaces with unknown parts. The evaluation of temporal logic formulae on partial Kripke structures is thus based on three-valued interpretations; the additional truth value $\bot$ stands for "unknown whether property true or false". There are existing model checking algorithms as well as tools employing this three-valued interpretation.In this paper we study the applicability of bounded model checkingtechniques to partial Kripke structures. To this end, we generalise the translation of Kripke structure and temporal logic formula to propositional logic as to include the value $\bot$, and define a new notion of satisfiability for propositional formulae containing $\bot$ as constants. We show that a check for this kind of satisfiability can be reduced to two checks for ordinary two-valued satisfiability, thus allowing for the use of standard SAT solvers.