Solving Sum and Product Riddle via BDD-Based Model Checking
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
Verification of epistemic properties in probabilistic multi-agent systems
MATES'09 Proceedings of the 7th German conference on Multiagent system technologies
Abstraction for model checking the probabilistic temporal logic of knowledge
AICI'10 Proceedings of the 2010 international conference on Artificial intelligence and computational intelligence: Part I
Abstraction for model checking multi-agent systems
Frontiers of Computer Science in China
Symbolic model checking of probabilistic knowledge
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Symbolic model checking the knowledge in Herbivore protocol
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
Model checking knowledge in pursuit evasion games
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Towards SAT-based BMC for LTLK over Interleaved Interpreted Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Combined model checking for temporal, probabilistic, and real-time logics
Theoretical Computer Science
Autonomous Agents and Multi-Agent Systems
Hi-index | 0.00 |
Model checking is a promising approach to automatic verification, which has concentrated on specification expressed in temporal logics. Comparatively little attention has been given to temporal logics of knowledge, although such logics have been proven to be very useful in the specifications of protocols for distributed systems. In this paper, we addressed the model checking problem for a temporal logic of knowledge (Halpern and Vardi's logic of CKLn). Based on the semantics of interpreted systems with local propositions, we developed an approach to symbolic CKLn model checking via Ordered Binary decision diagrams and implemented the corresponding symbolic model checker MCTK. In our approach to model checking specifications involving agents' knowledge, the knowledge modalities are eliminated via quantifiers over agents' non-observable variables. We then modelled the Dining Cryptographers protocol and the five-hands protocol for Russian Cards problem in MCTK. Via these two examples, we compare MCTK's empirical performance with two different state-of-the-art epistemic model checkers, MCK and MCMAS.