Bounded model checking knowledge and branching time in synchronous multi-agent systems

Authors:
Xiangyu Luo;Kaile Su;Abdul Sattar;Qingliang Chen;Guanfeng Lv
Affiliations:
Sun Yat-sen University, Guangzhou, P.R. China;Sun Yat-sen University, Guangzhou, P.R. China;Griffith University, Brisbane, Australia;Sun Yat-sen University, Guangzhou, P.R. China;Sun Yat-sen University, Guangzhou, P.R. China
Venue:
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Year:
2005

Citing 3
Cited 4

Reasoning about knowledge

Reasoning about knowledge
Verifying epistemic properties of multi-agent systems via bounded model checking

Fundamenta Informaticae - Concurrency specification and programming
ACTLS properties and Bounded Model Checking

Fundamenta Informaticae

QBF-based symbolic model checking for knowledge and time

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
The Complexity of Epistemic Model Checking: Clock Semantics and Branching Time

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Verification of multi-agent systems via bounded model checking

AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
A decision procedure for CTL* based on tableaux and automata

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an approach to the verification of temporal epistemic properties in synchronous multi-agent systems (MAS) via bounded model checking (BMC). Based on the semantics of synchronous interpreted system, we extend the temporal logic CTL* by incorporating epistemic modalities and obtain the so-called temporal epistemic logic CTL*K. 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 by using the semantics of synchronous interpreted system. 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 relation of the plain temporal epistemic model for time domain.