Bounded model checking for knowledge and linear time

Authors:
A. Meski;W. Penczek;M. Szreter;B. Woźna-Szcześniak;A. Zbrzezny
Affiliations:
Institute of Computer Science, PAS, Poland;Institute of Computer Science, PAS, Poland;Institute of Computer Science, PAS, Poland;Jan Długosz University, IMCS, Poland;Jan Długosz University, IMCS, Poland
Venue:
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Year:
2012

Citing 5
Cited 2

Model checking

Model checking
Verifying epistemic properties of multi-agent systems via bounded model checking

Fundamenta Informaticae - Concurrency specification and programming
Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol

Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
VerICS 2007 - a Model Checker for Knowledge and Real-Time

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Partial order reductions for model checking temporal epistemic logics over interleaved multi-agent systems

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1

Symbolic model checking for temporal-epistemic logic

Logic Programs, Norms and Action
BDD-versus SAT-based bounded model checking for the existential fragment of linear temporal logic with knowledge: algorithms and their performance

Autonomous Agents and Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate symbolic approaches to Bounded Model Checking (BMC) for the Linear Temporal Logic extended with epistemic components (LTLK), interpreted over Interleaved Interpreted Systems. We propose two BMC translations for LTLK - one is based on SAT and the other is based on BDD - which we have implemented and tested on several benchmarks. We report on our experimental results that reveal advantages and disadvantages of SAT-versus BDD-based BMC for LTLK.