Abstract

The paper deals with symbolic approaches to bounded model checking (BMC) for the existential fragment of linear temporal logic extended with the epistemic component (ELTLK), interpreted over interleaved interpreted systems. Two translations of BMC for ELTLK 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 ELTLK.

Highlights

  • Verification of multi-agent systems (MAS) is an actively developing field of research [7,8,14, 24,25,30,47]

  • In this paper we aim at completing the picture of applying the bounded model checking (BMC)-based symbolic verification to MAS by looking at the existential fragment of LTLK (i.e., LTL extended with the existential epistemic components, called ELTLK), interpreted over both the subclass of interpreted systems (IS) called interleaved interpreted systems (IIS) [31] and interpreted systems themselves

  • Observe that we assume that the LTLK formulae are given in the negation normal form (NNF), in which the negation can be only applied to propositional variables

Read more

Summary

Introduction

Verification of multi-agent systems (MAS) is an actively developing field of research [7,8,14, 24,25,30,47]. Several approaches based on model checking [12,48] have been put forward for the verification of MAS They employ combinations of the epistemic logic with either branching [8,30,43] or linear time temporal logic [17,22,38]. In this paper we aim at completing the picture of applying the BMC-based symbolic verification to MAS by looking at the existential fragment of LTLK (i.e., LTL extended with the existential epistemic components, called ELTLK), interpreted over both the subclass of interpreted systems (IS) called interleaved interpreted systems (IIS) [31] and interpreted systems themselves. Our original contribution consists in defining the following four novel bounded model checking methods for ELTLK: the SATbased BMC for IS and for IIS, and the BDD-based BMC for IS and for IIS. In the last section we discuss our experimental results and conclude the paper

Related work
Preliminaries
Interpreted systems
Interleaved interpreted systems
Runs and paths
Examples of MASs and their models
LTLKand its two subsets
Syntax
Semantics
Comments on IS and IIS
Bounded model checking
BDD-based Approach
Reduction of ELTLK to ELTL
BMC Algorithm
Model Checking ELTL
Model checking epistemic modalities
SAT-based Approach
Bounded semantics for ELTLK
Equivalence of the bounded and unbounded semantics
Translation to the propositional satisfiability problem
Correctness and completeness of the translation
Experimental results
Performance evaluation
Comparison with MCK
Final remarks
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call