Towards SAT-based BMC for LTLK over Interleaved Interpreted Systems

Authors:
Wojciech Penczek;Bożena Woźna-Szcześniak;Andrzej Zbrzezny
Affiliations:
Polish Academy of Sciences, ICS, Ordona 21, 01-237 Warsaw, Poland and University of Natural Sciences and Humanities, ICS, Sienkiewicza 51, 08-110 Siedlce, Poland, penczek@ipipan.waw.pl;(Correspd.) IM&CS, Jan Dłługosz University, Al. Armii Krajowej 13/15, 42-200 Częstochowa, Poland, {b.wozna, a.zbrzezny}@ajd.czest.pl;IM&CS, Jan Dłługosz University, Al. Armii Krajowej 13/15, 42-200 Częstochowa, Poland, {b.wozna, a.zbrzezny}@ajd.czest.pl
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Year:
2012

Citing 15
Cited 1

Reasoning about knowledge

Reasoning about knowledge
Model checking

Model checking
Knowledge and the logic of local propositions

TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
Model Checking Knowledge and Time

Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Symbolic Reachability Analysis Based on SAT-Solvers

TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
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
Fast LTL to Büchi Automata Translation

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
All from One, One for All: on Model Checking Using Representatives

CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Symbolic Model Checking the Knowledge of the Dining Cryptographers

CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Model Checking Temporal Logics of Knowledge Via OBDDs1

The Computer Journal
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
From Bounded to Unbounded Model Checking for Temporal Epistemic Logic

Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Verifying Epistemic Properties of Multi-agent Systems via Bounded Model Checking

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2
Checking Reachability Properties for Timed Automata via SAT

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2

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

This paper makes two contributions to the verification of multi-agent systems modelled by interleaved interpreted systems. Firstly, the paper presents theoretical underpinnings of the SAT-based bounded model checking (BMC) approach for LTL extended with the epistemic component (LTLK) over interleaved interpreted systems. Secondly, the BMC method has been implemented and tested on several benchmarks for MAS. The preliminary experimental results reveal advantages and disadvantages of our SAT-based BMC for LTLK and show that the method has a significant potential.