Bounded model checking for knowledge and real time

We present TECTLK, a logic to specify knowledge and real time in multi-agent systems. We show that the model checking problem is decidable, and we present an algorithm for TECTLK bounded model checking based on a discretisation method. We exemplify the use of the technique by means of the "Railroad Crossing System", a popular example in the multi-agent systems literature.

[1]  Joseph Y. Halpern,et al.  Complete Axiomatizations for Reasoning about Knowledge and Time , 2002, SIAM J. Comput..

[2]  Gilles Audemard,et al.  Bounded Model Checking for Timed Systems , 2002, FORTE.

[3]  Ron van der Meyden,et al.  MCK: Model Checking the Logic of Knowledge , 2004, CAV.

[4]  Alessio Lomuscio,et al.  Verification of multiagent systems via ordered binary decision diagrams: an algorithm and its implementation , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[5]  Wojciech Penczek,et al.  Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol , 2006, Fundam. Informaticae.

[6]  P. Varaiya,et al.  Discretization of timed automata , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

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

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

[9]  Rajeev Alur,et al.  Model-Checking in Dense Real-time , 1993, Inf. Comput..

[10]  Wojciech Penczek,et al.  Specification and Model Checking of Temporal Properties in Time Petri Nets and Timed Automata , 2004, ICATPN.

[11]  Wojciech Penczek,et al.  VerICS 2004: A Model Checker for Real Time and Multi-agent Systems ? , 2004 .

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

[13]  Michael Wooldridge,et al.  Cooperation, Knowledge, and Time: Alternating-time Temporal Epistemic Logic and its Applications , 2003, Stud Logica.

[14]  Alessio Lomuscio,et al.  Deontic Interpreted Systems , 2003, Stud Logica.

[15]  Ronen I. Brafman,et al.  Applications of a logic of knowledge to motion planning under uncertainty , 1997, JACM.

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

[17]  Ron van der Meyden,et al.  Complete Axiomatizations for Reasoning about Knowledge and Branching Time , 2003, Stud Logica.

[18]  Joseph Y. Halpern,et al.  A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief , 1992, Artif. Intell..

[19]  Alessio Lomuscio,et al.  A Logic for Knowledge, Correctness, and Real Time , 2004, CLIMA.

[20]  Yoram Moses,et al.  Knowledge, timed precedence and clocks (preliminary report) , 1994, PODC '94.

[21]  Wojciech Penczek,et al.  Verification of multiagent systems via unbounded model checking , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[22]  Insup Lee,et al.  An efficient state space generation for analysis of real-time systems , 1996, ISSTA '96.

[23]  Andrzej Zbrzezny.  Improvements in SAT-based Reachability Analysis for Timed Automata , 2004, Fundam. Informaticae.

[24]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

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

[26]  Yoram Moses,et al.  Knowledge, Timed Precedence and Clocks , 1995, PODC 1995.

[27]  Wojciech Penczek,et al.  Towards Bounded Model Checking for the Universal Fragment of TCTL , 2002, FTRTFT.

[28]  Stavros Tripakis,et al.  Analysis of Timed Systems Using Time-Abstracting Bisimulations , 2001, Formal Methods Syst. Des..

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

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

[31]  Wojciech Penczek,et al.  Bounded Model Checking for Deontic Interpreted Systems , 2005, LCMAS.

[32]  Joseph Y. Halpern,et al.  The Complexity of Reasoning about Knowledge and Time. I. Lower Bounds , 1989, J. Comput. Syst. Sci..

[33]  Ronald Fagin,et al.  What can machines know?: On the properties of knowledge in distributed systems , 1992, JACM.

[34]  W. Richard Stark.  A Logic of Knowledge , 1981, Math. Log. Q..

[35]  Masahiro Fujita,et al.  Symbolic model checking using SAT procedures instead of BDDs , 1999, DAC '99.

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

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