Two approaches to bounded model checking for linear time logic with knowledge

Authors:
Artur Męski;Wojciech Penczek;Maciej Szreter;Bożena Woźna-Szcześniak;Andrzej Zbrzezny
Affiliations:
Institute of Computer Science, PAS, Poland,University of Natural Sciences and Humanities, II, Poland;University of Natural Sciences and Humanities, II, Poland,FMCS, University of Łódź, Poland;University of Natural Sciences and Humanities, II, Poland;IMCS, Jan Długosz University, Poland;IMCS, Jan Długosz University, Poland
Venue:
KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
Year:
2012

Citing 10
Cited 1

Reasoning about knowledge

Reasoning about knowledge
Model checking

Model checking
Can BDDs compete with SAT solvers on bounded model checking?

Proceedings of the 39th annual Design Automation Conference
Model Checking Knowledge and Time

Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Model Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract)

Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Another Look at LTL Model Checking

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Verifying epistemic properties of multi-agent systems via bounded model checking

Fundamenta Informaticae - Concurrency specification and programming
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
Improved bounded model checking for a fair branching-time temporal epistemic logic

MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence

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

The paper deals with symbolic approaches to bounded model checking (BMC) for Linear Time Temporal Logic extended with the epistemic component (LTLK), interpreted over Interleaved Interpreted Systems. Two translations of BMC for LTLK to SAT and to operations on BDDs are presented. The translations have been implemented, tested, and compared with each other as well as with another tool on several benchmarks for MAS. Our experimental results reveal advantages and disadvantages of SAT- versus BDD-based BMC for LTLK.