Verification of Multi-agent Systems Via Bounded Model Checking

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.

[1]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[2]  Wojciech Penczek,et al.  Verifying epistemic properties of multi-agent systems via bounded model checking , 2002, AAMAS '03.

[3]  Joseph Y. Halpern,et al.  Model Checking vs. Theorem Proving: A Manifesto , 1991, KR.

[4]  Michael Wooldridge,et al.  Model Checking Knowledge and Time , 2002, SPIN.

[5]  Michael Wooldridge,et al.  Model checking agentspeak , 2003, AAMAS '03.

[6]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[7]  Wojciech Penczek,et al.  From Bounded to Unbounded Model Checking for Temporal Epistemic Logic , 2004, Fundam. Informaticae.

[8]  Bozena Wozna,et al.  ACTLS properties and Bounded Model Checking , 2004, Fundam. Informaticae.

[9]  Kaile Su,et al.  Model Checking Temporal Logics of Knowledge in Distributed Systems , 2004, AAAI.

[10]  Wojciech Penczek,et al.  Bounded Model Checking for the Universal Fragment of CTL , 2002, Fundam. Informaticae.

[11]  Kaile Su,et al.  Symbolic model checking the knowledge of the dining cryptographers , 2004, Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004..

[12]  Abdul Sattar,et al.  Bounded model checking knowledge and branching time in synchronous multi-agent systems , 2005, AAMAS '05.

[13]  Michael Wooldridge,et al.  Tractable multiagent planning for epistemic goals , 2002, AAMAS '02.

[14]  Stephan Merz,et al.  Model Checking , 2000 .

[15]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[16]  Yoram Hirshfeld,et al.  Logics for Real Time: Decidability and Complexity , 2004, Fundam. Informaticae.