Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Local model checking in the modal mu-calculus
TAPSOFT '89 2nd international joint conference on Theory and practice of software development
Reasoning about knowledge
Model checking
Epistemic Logic for AI and Computer Science
Epistemic Logic for AI and Computer Science
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Counterexample-guided abstraction refinement for symbolic model checking
Journal of the ACM (JACM)
Symbolic Model Checking the Knowledge of the Dining Cryptographers
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Sum and Product in Dynamic Epistemic Logic
Journal of Logic and Computation
Hintikka Games for PCTL on Labeled Markov Chains
QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations
Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations
MCMAS: a model checker for multi-agent systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Hi-index | 0.00 |
Model checking games are instances of Hintikka's game semantics for logic used for purposes of debugging systems verification models. Previous work in the area has developed these games for branching time logic. The paper develops an extension to a logic that adds epistemic operators, and interprets the branching time operators with respect to fairness constraints. The implementation of the extended games in the epistemic model checker MCK is described.