From Bounded to Unbounded Model Checking for Temporal Epistemic Logic

This paper addresses the problem of verification of temporal epistemic properties of multi-agent systems by means of symbolic model checking. An overview of the technique of bounded model checking for temporal epistemic logic, and an analysis of some limitations of the method are provided. An extension of this technique called unbounded model checking to solve these limitations is explored. Similarities and differences of the two methods are explicitly exemplified by the analysis of a scenario in the two formalisms.

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

[2]  A. Tarski A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[3]  Y. Shoham Introduction to Multi-Agent Systems , 2002 .

[4]  Ron van der Meyden,et al.  Model Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract) , 1999, FSTTCS.

[5]  Wojciech Penczek,et al.  Bounded Model Checking for Interpreted Systems: Preliminary Experimental Results , 2002, FAABS.

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

[7]  Edmund M. Clarke,et al.  Characterizing Correctness Properties of Parallel Programs Using Fixpoints , 1980, ICALP.

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

[9]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

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

[11]  Michael Wooldridge,et al.  Introduction to multiagent systems , 2001 .

[12]  Kenneth L. McMillan,et al.  Symbolic model checking , 1992 .

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

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

[15]  Edmund M. Clarke,et al.  Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons , 1982, Sci. Comput. Program..

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

[17]  Armin Biere,et al.  Bounded Model Checking Using Satisfiability Solving , 2001, Formal Methods Syst. Des..

[18]  Kenneth L. McMillan,et al.  Applying SAT Methods in Unbounded Symbolic Model Checking , 2002, CAV.

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

[20]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.