Location of Repository

BDD-based Bounded Model Checking for LTLK over Two Variants of Interpreted Systems ⋆

By Wojciech Penczek and Maciej Szreter

Abstract

Abstract We present a novel approach to verification of multi-agent systems by bounded model checking for Linear Time Temporal Logic extended with the epistemic component (LTLK). The systems are modelled by two variants of interpreted systems: standard and interleaved ones. Our method is based on binary decision diagrams (BDD). We describe the algorithm and provide its experimental evaluation together with the comparison with another tool. This allows to draw some conclusions which semantics is preferable for bounded model checking LTLK properties of multi-agent systems.

Year: 2014
OAI identifier: oai:CiteSeerX.psu:10.1.1.416.4858
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://ceur-ws.org/Vol-853/lam... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.