Verification of Multi-agent Systems Via Bounded Model Checking

   page       BibTeX_logo.png   
Xiangyu Luo, Kaile Su, Abdul Sattar, Mark Reynolds
AI 2006: Advances in Artificial Intelligence 19th Australian Joint Conference on Artificial Intelligence, Hobart, Australia, December 4-8, 2006. Proceedings
Lecture Notes in Computer Science 4304

We present a bounded model checking (BMC) approach to the verification of temporal epistemic properties of multi-agent systems. We extend the temporal logic CTL * by incorporating epistemic modalities and obtain a temporal epistemic logic that we call CTL * K. CTL * K logic is interpreted under the semantics of synchronous interpreted systems. Though CTL * K is of great expressive power in both temporal and epistemic dimensions, we show that BMC method is still applicable for the universal fragment of CTL * K. We present in some detail a BMC algorithm and prove its correctness. In our approach, agents’ knowledge interpreted in synchronous semantics can be skillfully attained by the state position function, which avoids extending the encoding of the states and the transition relations of the plain temporal epistemic model for time domain.

keywordsbounded model checking - multi-agent systems - temporal epistemic logic - bounded semantics

Partita IVA: 01131710376 — Copyright © 2008–2023 APICe@DISI – PRIVACY