The BMC method for the existential part of RTCTLK and interleaved interpreted systems

Authors:
Bozena Wozna-Szczesniak;Agnieszka Zbrzezny;Andrzej Zbrzezny
Affiliations:
IMCS, Jan Dlugosz University, Czestochowa, Poland;IMCS, Jan Dlugosz University, Czestochowa, Poland;IMCS, Jan Dlugosz University, Czestochowa, Poland
Venue:
EPIA'11 Proceedings of the 15th Portugese conference on Progress in artificial intelligence
Year:
2011

Citing 17
Cited 2

The complexity of reasoning about knowledge and time. I. lower bounds

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Quantitative temporal reasoning

Real-Time Systems
What can machines know?: On the properties of knowledge in distributed systems

Journal of the ACM (JACM)
Reasoning about knowledge

Reasoning about knowledge
Symbolic model checking using SAT procedures instead of BDDs

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Model checking

Model checking
Modal logic

Modal logic
Bounded model checking for the universal fragment of CTL

Fundamenta Informaticae
Model Checking Knowledge and Time

Proceedings of the 9th International SPIN Workshop on Model Checking of Software
All from One, One for All: on Model Checking Using Representatives

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

Fundamenta Informaticae - Concurrency specification and programming
Symbolic Model Checking the Knowledge of the Dining Cryptographers

CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
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
Improving the Translation from ECTL to SAT

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
Bounded model checking for the existential part of real-time CTL and knowledge

CEE-SET'09 Proceedings of the 4th IFIP TC 2 Central and East European conference on Advances in Software Engineering Techniques

SAT-Based bounded model checking for deontic interleaved interpreted systems

KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
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

In the paper, we focus on the formal verification of multi-agent systems - modelled by interleaved interpreted systems - by means of the bounded model checking (BMC) method, where specifications are expressed in the existential fragment of the Real-Time Computation Tree Logic augmented to include standard epistemic operators (RTECTLK). In particular, we define an improved SAT-based BMC for RTECTLK, and present performance evaluation of our newly developed BMC method by means of the well known train controller and generic pipeline systems.