Local model checking in the modal mu-calculus
TAPSOFT '89 2nd international joint conference on Theory and practice of software development
Model checking
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Quantitative solution of omega-regular games380872
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Model-checking infinite state-space systems with fine-grained abstractions using SPIN
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
A framework for multi-valued reasoning over inconsistent viewpoints
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Model exploration with temporal logic query checking
Proceedings of the 10th ACM SIGSOFT symposium on Foundations of software engineering
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Model Checking Games for the Alternation-Free µ-Calculus and Alternating Automata
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
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
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Automatic Abstraction Using Generalized Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
A game-based framework for CTL counterexamples and 3-valued abstraction-refinement
ACM Transactions on Computational Logic (TOCL)
Multi-valued model checking games
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Simulation for lattice-valued doubly labeled transition systems
International Journal of Approximate Reasoning
Hi-index | 0.00 |
This work extends the game-based framework of @m-calculus model checking to the multi-valued setting. In multi-valued model checking a formula is interpreted over a Kripke structure defined over a lattice. The value of the formula is also an element of the lattice. This problem has many applications in verification, such as handling abstract or partial models, analyzing systems in the presence of inconsistent views, and performing temporal logic query checking. We define a new game for the multi-valued model checking problem of the full @m-calculus, and demonstrate how to derive from it a direct model checking algorithm for its alternation-free fragment. The algorithm handles the multi-valued structure without any reduction. We investigate the properties of the new game, both independently, and in comparison to the automata-based approach. We show that the usual resemblance between the automata-based and the game-based approach does not hold in the multi-valued setting and show how it can be regained by changing the nature of the game.