Automatic verification of parameterised multi-agent systems

A key problem in verification of multi-agent systems by model checking concerns the fact that the state-space of the system grows exponentially with the number of agents present. This often makes practical model checking unfeasible whenever the system contains more than a few agents. In this paper we put forward a technique to establish a cutoff result, thereby showing that systems with an arbitrary number of agents can be verified by checking a single system consisting of a number of agents equal to the cutoff of the system. While this problem is undecidable in general, we here define a class of parameterised interpreted systems and a parameterised temporal-epistemic logic for which the result can be shown. We exemplify the theoretical results on a robotic example and present an implementation of the technique as an extension of MCMAS, an open-source model checker for multi-agent systems.

[1]  Kedar S. Namjoshi,et al.  Reasoning about rings , 1995, POPL '95.

[2]  Wojciech Penczek,et al.  Partial Order Reductions for Model Checking Temporal-epistemic Logics over Interleaved Multi-agent Systems , 2010, Fundam. Informaticae.

[3]  Samik Basu,et al.  Automating Cut-off for Multi-parameterized Systems , 2010, ICFEM.

[4]  Krzysztof R. Apt,et al.  Limits for Automatic Verification of Finite-State Concurrent Systems , 1986, Inf. Process. Lett..

[5]  Vineet Kahlon,et al.  Reducing Model Checking of the Many to the Few , 2000, CADE.

[6]  Edmund M. Clarke,et al.  Reasoning about Networks with Many Identical Finite State Processes , 1989, Inf. Comput..

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

[8]  Wojciech Penczek,et al.  Improving Partial Order Reductions for Universal Branching Time Properties , 2000, Fundam. Informaticae.

[9]  Vineet Kahlon,et al.  Model checking guarded protocols , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[10]  A. Prasad Sistla,et al.  Symmetry and model checking , 1996, Formal Methods Syst. Des..

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

[12]  Wojciech Penczek,et al.  VerICS 2007 - a Model Checker for Knowledge and Real-Time , 2008, Fundam. Informaticae.

[13]  Mads Dam,et al.  Abstraction in model checking multi-agent systems , 2009, AAMAS 2009.

[14]  Amir Pnueli,et al.  Liveness with (0, 1, infty)-Counter Abstraction , 2002, CAV.

[15]  Helmut Veith,et al.  Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems , 2008, TACAS.

[16]  Alessio Lomuscio,et al.  MCMAS: A Model Checker for the Verification of Multi-Agent Systems , 2009, CAV.

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