Verifying Communicating Agents by Model Checking in a Temporal Action Logic

In this paper we address the problem of specifying and verifying systems of communicating agents in a Dynamic Linear Time Temporal Logic (DLTL). This logic provides a simple formalization of the communicative actions in terms of their effects and preconditions. Furthermore it allows to specify interaction protocols by means of temporal constraints representing permissions and commitments. Agent programs, when known, can be formulated in DLTL as complex actions (regular programs). The paper addresses several kinds of verification problems including the problem of compliance of agents to the protocol, and describes how they can be solved by model checking in DLTL using automata.

[1]  Michael Wooldridge,et al.  Model checking for ACL compliance verification , 2003, AAMAS '03.

[2]  Vladimir Lifschitz,et al.  Artificial intelligence and mathematical theory of computation: papers in honor of John McCarthy , 1991 .

[3]  Francis Guerin,et al.  Specifying agent communication languages , 2002 .

[4]  P. S. Thiagarajan,et al.  Dynamic Linear Time Temporal Logic , 1997 .

[5]  Michael Wooldridge,et al.  Model checking multi-agent systems with MABLE , 2002, AAMAS '02.

[6]  Frank Dignum Advances in Agent Communication , 2003, Lecture Notes in Computer Science.

[7]  Pierre Wolper,et al.  Simple on-the-fly automatic verification of linear temporal logic , 1995, PSTV.

[8]  Laura Giordano,et al.  Specifying and Verifying Systems of Communicating Agents in a Temporal Action Logic , 2003, AI*IA.

[9]  Marc-Philippe Huget,et al.  Communication in Multiagent Systems , 2003 .

[10]  Laura Giordano,et al.  Reasoning about Actions in Dynamic Linear Time Temporal Logic , 2001, Log. J. IGPL.

[11]  Paola Mello,et al.  Specification and verification of agent interaction protocols in a logic-based system , 2004, SAC '04.

[12]  Fausto Giunchiglia,et al.  Model Checking Multiagent Systems , 1998, J. Log. Comput..

[13]  Fausto Giunchiglia,et al.  Planning as Model Checking , 1999, ECP.

[14]  Munindar P. Singh,et al.  Flexible protocol specification and execution: applying event calculus planning using commitments , 2002, AAMAS '02.

[15]  Daniel S. Weld Recent Advances in AI Planning , 1999, AI Mag..

[16]  Marco Colombetti,et al.  Defining interaction protocols using a commitment-based agent communication language , 2003, AAMAS '03.

[17]  Raymond Reiter,et al.  The Frame Problem in the Situation Calculus: A Simple Solution (Sometimes) and a Completeness Result for Goal Regression , 1991, Artificial and Mathematical Theory of Computation.

[18]  Munindar P. Singh A Social Semantics for Agent Communication Languages , 2000, Issues in Agent Communication.

[19]  Franco Turini,et al.  AI*IA 2003: Advances in Artificial Intelligence , 2003, Lecture Notes in Computer Science.

[20]  Diego Calvanese,et al.  Reasoning about Actions and Planning in LTL Action Theories , 2002, KR.

[21]  Carl A. Sunshine,et al.  Protocol Specification, Testing and Verification - Guest Editorial , 1982, Comput. Networks.

[22]  Barbara Dunin-Keplicz,et al.  Creating Collective Intention through Dialogue , 2001, Log. J. IGPL.

[23]  Michael Wooldridge,et al.  Semantic Issues in the Verification of Agent Communication Languages , 2000, Autonomous Agents and Multi-Agent Systems.

[24]  Marco Pistore,et al.  Planning as Model Checking for Extended Goals in Non-deterministic Domains , 2001, IJCAI.

[25]  Frank Guerin,et al.  Verification and Compliance Testing , 2003, Communication in Multiagent Systems.

[26]  Laura Giordano,et al.  On-the-fly automata construction for dynamic linear time temporal logic , 2004, Proceedings. 11th International Symposium on Temporal Representation and Reasoning, 2004. TIME 2004..

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

[28]  Fahiem Bacchus,et al.  Planning for temporally extended goals , 1996, Annals of Mathematics and Artificial Intelligence.