Verification of multi-agent systems via bounded model checking

Authors:
Xiangyu Luo;Kaile Su;Abdul Sattar;Mark Reynolds
Affiliations:
Department of Computer Science, Guilin University of Electronic Technology, Guilin, China;Institute for Integrated and Intelligent Systems, Griffith University, Brisbane, Australia;Institute for Integrated and Intelligent Systems, Griffith University, Brisbane, Australia;School of CSSE, The University of Western Australia, Perth, Australia
Venue:
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Year:
2006

Citing 12
Cited 3

Reasoning about knowledge

Reasoning about knowledge
Tractable multiagent planning for epistemic goals

Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
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
Symbolic Model Checking without BDDs

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Model checking agentspeak

AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
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
Bounded model checking knowledge and branching time in synchronous multi-agent systems

Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
ACTLS properties and Bounded Model Checking

Fundamenta Informaticae
From Bounded to Unbounded Model Checking for Temporal Epistemic Logic

Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Model checking temporal logics of knowledge in distributed systems

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence

Solving Sum and Product Riddle via BDD-Based Model Checking

WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
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
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.