Verifying Compliance with Commitment Protocols Enabling Open Web-Based Multiagent Systems

Interaction protocols are specific, often standard, constraints on the behaviors of autonomous agents in a multiagent system. Protocols are essential to the functioning of open systems, such as those that arise in most interesting web applications. A variety of common protocols in negotiation and electronic commerce are best treated as commitment protocols, which are defined, or at least analyzed, in terms of the creation, satisfaction, or manipulation of the commitments among the participating agents. When protocols are employed in open environments, such as the Internet, they must be executed by agents that behave more or less autonomously and whose internal designs are not known. In such settings, therefore, there is a risk that the participating agents may fail to comply with the given protocol. Without a rigorous means to verify compliance, the very idea of protocols for interoperation is subverted. We develop an approach for testing whether the behavior of an agent complies with a commitment protocol. Our approach requires the specification of commitment protocols in temporal logic, and involves a novel way of synthesizing and applying ideas from distributed computing and logics of program.

[1]  FOUNDATION FOR INTELLIGENT PHYSICAL AGENTS 2 3 4 FIPA Modeling Area : Environment , 2022 .

[2]  Munindar P. Singh Developing formal specifications to coordinate heterogeneous autonomous agents , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).

[3]  Nicholas Carriero,et al.  Coordination languages and their significance , 1992, CACM.

[4]  Kenneth P. Birman,et al.  A response to Cheriton and Skeen's criticism of causal and totally ordered communication , 1994, OPSR.

[5]  Ira R. Forman,et al.  Interacting processes: a multiparty approach to coordinated distributed programming , 1996 .

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

[7]  Friedemann Mattern,et al.  Detecting causal relationships in distributed computations: In search of the holy grail , 1994, Distributed Computing.

[8]  Fabio Vitali,et al.  PageSpace: An Architecture to Coordinate Distributed Applications on the Web , 1996, Comput. Networks.

[9]  Michael Wooldridge,et al.  Verifiable semantics for agent communication languages , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).

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

[11]  Pablo Noriega,et al.  Towards a Test-Bed for Trading Agents in Electronic Auction Markets , 1998, AI Commun..

[12]  Munindar P. Singh A Customizable Coordination Service for Autonomous Agents , 1997, ATAL.

[13]  Gul Agha,et al.  Concurrent Programming for Distributed Artificial Intelligence , 1999 .

[14]  Kenneth P. Birman,et al.  The process group approach to reliable distributed computing , 1992, CACM.

[15]  Munindar P. Singh An ontology for commitments in multiagent systems: , 1999, Artificial Intelligence and Law.

[16]  David R. Cheriton,et al.  Understanding the limitations of causally and totally ordered communication , 1994, SOSP '93.

[17]  Munindar P. Singh Applying the Mu-Calculus in Planning and Reasoning about Action , 1998, J. Log. Comput..

[18]  Fabio Vitali,et al.  Coordinating Multiagent Aplications on the WWW: A Reference Architecture , 1998, IEEE Trans. Software Eng..

[19]  Andreas Reuter,et al.  Transaction Processing: Concepts and Techniques , 1992 .

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