Specification and Verification of Multi-Agent Systems

Overview. Multi agent systems (MAS) provide an important framework for formalizing various problems in computer science, artificial intelligence, game theory, social choice theory, etc. Modal logics are amongst the most suitable and versatile logical formalisms for specification and verification of computational systems. Here, we present an overview of some important developments in the area. We introduce modal logics used for specification of temporal, epistemic, and strategic properties of systems; then, we present some model checking algorithms, and discuss the computational complexity of the model checking problem. Finally, we consider symbolic (compact) representations of systems based on Binary Decision Diagrams (BDD) and propositional logic formulas, and show how the representations change the algorithmic side of model checking. We also discuss other techniques that help to reduce the complexity and make the verification feasible even for large systems.

[1]  W. Jamroga.  Some Remarks on Alternating Temporal Epistemic Logic , 2003 .

[2]  Wojciech Jamroga,et al.  A logic for strategic reasoning , 2005, AAMAS '05.

[3]  Jürgen Dix,et al.  Reasoning about temporal properties of rational play , 2008, Annals of Mathematics and Artificial Intelligence.

[4]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[5]  Henning Schnoor.  Strategic planning for probabilistic games with incomplete information , 2010, AAMAS.

[6]  Wojciech Jamroga,et al.  Easy Yet Hard: Model Checking Strategies of Agents , 2009, CLIMA.

[7]  Anand S. Rao,et al.  Modeling Rational Agents within a BDI-Architecture , 1997, KR.

[8]  Wojciech Jamroga,et al.  State and Path Effectivity Models for Logics of Multi-Player Games , 2012 .

[9]  Nikolay V. Shilov,et al.  Model checking knowledge and fixpoints , 2002, FICS.

[10]  Philippe Schnoebelen,et al.  Model Checking CTL+ and FCTL is Hard , 2001, FoSSaCS.

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

[12]  Wojciech Jamroga,et al.  Agents that Know How to Play , 2004, Fundam. Informaticae.

[13]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

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

[15]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[16]  W. Jamroga,et al.  Constructive Knowledge: What Agents Can Achieve under Incomplete Information , 2005 .

[17]  Wojciech Penczek,et al.  Verics: A Tool for Verifying Timed Automata and Estelle Specifications , 2003, TACAS.

[18]  Alessio Lomuscio,et al.  Automatic Verification of Deontic Interpreted Systems by Model Checking via OBDD's , 2004, ECAI.

[19]  Jürgen Dix,et al.  Model Checking Abilities under Incomplete Information Is Indeed Delta2-complete , 2006, EUMAS.

[20]  Wojciech Jamroga,et al.  Strategic games and truly playable effectivity functions , 2013, Autonomous Agents and Multi-Agent Systems.

[21]  Gerhard Weiss,et al.  Multiagent systems: a modern approach to distributed artificial intelligence , 1999 .

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

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

[24]  Geert Jonker,et al.  On Epistemic Temporal Strategic Logic , 2005, LCMAS.

[25]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

[26]  Constantin Enea,et al.  An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking , 2011, J. Appl. Non Class. Logics.

[27]  Kaile Su,et al.  Probabilistic Alternating-Time Temporal Logic of Incomplete Information and Synchronous Perfect Recall , 2012, AAAI.

[28]  Jean-François Raskin,et al.  Games with imperfect information: theory and algorithms , 2011, Lectures in Game Theory for Computer Scientists.

[29]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

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

[31]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[32]  Nicolas Markey,et al.  On the Expressiveness and Complexity of ATL , 2007, FoSSaCS.

[33]  Pierre-Yves Schobbens,et al.  Alternating-time logic with imperfect recall , 2004, LCMAS.

[34]  Michael Wooldridge,et al.  On the complexity of practical ATL model checking , 2006, AAMAS '06.

[35]  Wojciech Jamroga,et al.  Alternating Epistemic Mu-Calculus , 2011, IJCAI.

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

[37]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[38]  Thomas A. Henzinger,et al.  Model checking discounted temporal properties , 2005, Theor. Comput. Sci..

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

[40]  W. Jamroga,et al.  Modular Interpreted Systems : A Preliminary Report , 2006 .

[41]  Nikolay V. Shilov,et al.  Update and Abstraction in Model Checking of Knowledge and Branching Time , 2006, Fundam. Informaticae.

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

[43]  J. Reif,et al.  Lower bounds for multiplayer noncooperative games of incomplete information , 2001 .

[44]  Pierre Wolper,et al.  An automata-theoretic approach to branching-time model checking , 2000, JACM.

[45]  Hector J. Levesque,et al.  Intention is Choice with Commitment , 1990, Artif. Intell..

[46]  Wojciech Penczek,et al.  Verifying Multi-agent Systems via Unbounded Model Checking , 2004, FAABS.

[47]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[48]  Alessio Lomuscio,et al.  Automatic Verification of Deontic Properties of Multi-agent Systems , 2004, DEON.

[49]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[50]  Valentin Goranko,et al.  Complete axiomatization and decidability of Alternating-time temporal logic , 2006, Theor. Comput. Sci..

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

[52]  A. Prasad Sistla,et al.  Automatic verification of finite state concurrent system using temporal logic specifications: a practical approach , 1983, POPL '83.

[53]  Valentin Goranko,et al.  Logic in Computer Science: Modelling and Reasoning About Systems , 2007, J. Log. Lang. Inf..

[54]  Alasdair Urquhart,et al.  Temporal Logic , 1971 .

[55]  Franco Raimondi,et al.  Model checking multi-agent systems , 2006 .

[56]  Yoav Shoham,et al.  Essentials of Game Theory: A Concise Multidisciplinary Introduction , 2008, Essentials of Game Theory: A Concise Multidisciplinary Introduction.

[57]  Joseph Y. Halpern,et al.  Reasoning about knowledge: a survey , 1995 .

[58]  Melvin Fitting,et al.  First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.

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

[60]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[61]  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..

[62]  Ferucio Laurentiu Tiplea,et al.  Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable , 2011, ArXiv.

[63]  Jürgen Dix,et al.  Do Agents Make Model Checking Explode (Computationally)? , 2005, CEEMAS.

[64]  Neil Immerman,et al.  Number of Quantifiers is Better Than Number of Tape Cells , 1981, J. Comput. Syst. Sci..

[65]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

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

[67]  John H. Reif,et al.  Multiple-person alternation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[68]  Wojciech Penczek,et al.  Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach , 2006, Studies in Computational Intelligence.

[69]  Wojciech Penczek,et al.  Fully Symbolic Unbounded Model Checking for Alternating-time Temporal Logic1 , 2005, Autonomous Agents and Multi-Agent Systems.

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

[71]  Wojciech Jamroga,et al.  What Agents Can Probably Enforce , 2009, Fundam. Informaticae.

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

[73]  Wojciech Penczek,et al.  Logic Column 19: Symbolic Model Checking for Temporal-Epistemic Logics , 2007, ArXiv.

[74]  Jürgen Dix,et al.  Model Checking Abilities of Agents: A Closer Look , 2008, Theory of Computing Systems.

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

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

[77]  Wojciech Jamroga,et al.  Constructive knowledge: what agents can achieve under imperfect information , 2007, J. Appl. Non Class. Logics.

[78]  W. Hoek,et al.  Epistemic logic: a survey , 2002 .

[79]  Jerzy Tiuryn,et al.  Dynamic logic , 2001, SIGA.

[80]  Chin-Laung Lei,et al.  Modalities for Model Checking: Branching Time Logic Strikes Back , 1987, Sci. Comput. Program..

[81]  Wojciech Jamroga,et al.  Modular interpreted systems , 2007, AAMAS '07.

[82]  Amir Pnueli,et al.  Distributed reactive systems are hard to synthesize , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[83]  Colin Stirling,et al.  Modal and Temporal Properties of Processes , 2001, Texts in Computer Science.

[84]  N. Bulling.  Model Checking Coalition Logic on Implicit Models is ∆ P 3-complete , 2010 .

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

[86]  Yde Venema,et al.  Dynamic Logic by David Harel, Dexter Kozen and Jerzy Tiuryn. The MIT Press, Cambridge, Massachusetts. Hardback: ISBN 0–262–08289–6, $50, xv + 459 pages , 2002, Theory and Practice of Logic Programming.

[87]  J. Dix,et al.  Model Checking Logics of Strategic Ability: Complexity* , 2010 .

[88]  Mary Sheeran,et al.  Checking Safety Properties Using Induction and a SAT-Solver , 2000, FMCAD.

[89]  Wojciech Jamroga.  A Temporal Logic for Stochastic Multi-Agent Systems , 2008, PRIMA.

[90]  Chin-Laung Lei,et al.  Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract) , 1986, LICS.

[91]  Amir Pnueli,et al.  Checking that finite state concurrent programs satisfy their linear specification , 1985, POPL.

[92]  Catriel Beeri,et al.  On the menbership problem for functional and multivalued dependencies in relational databases , 1980, TODS.

[93]  Armin Biere,et al.  Bounded model checking , 2003, Adv. Comput..

[94]  A. Prasad Sistla,et al.  The complexity of propositional linear temporal logics , 1982, STOC '82.

[95]  Philippe Schnoebelen,et al.  The Complexity of Temporal Logic Model Checking , 2002, Advances in Modal Logic.

[96]  Cees Witteveen,et al.  A Modal Characterization of Nash Equilibrium , 2003, Fundam. Informaticae.

[97]  Wojciech Penczek,et al.  Symbolic model checking for temporal-epistemic logics , 2007, SIGA.

[98]  A. Prasad Sistla,et al.  Deciding branching time logic , 1984, STOC '84.

[99]  Wojciech Jamroga,et al.  Alternating-time temporal logics with irrevocable strategies , 2007, TARK '07.

[100]  Thomas Ågotnes,et al.  Action and Knowledge in Alternating-Time Temporal Logic , 2006, Synthese.

[101]  Michael Wooldridge,et al.  Alternating-time temporal logic with explicit strategies , 2007, TARK '07.

[102]  Marc Pauly,et al.  Logic for social software , 2000 .