On illegal composition of first-class agent interaction protocols

In this paper, we examine the composition of first-class protocols for multi-agent systems. First-class protocols are protocols that exist as executable specifications that agents use at runtime to acquire the rules of the protocol. This is in contrast to the standard approach of hard-coding interaction protocols directly into agents --- an approach that seems too restrictive for many intelligent and adaptive agents. In previous work, we have proposed a framework called RASA, which regards protocols as first-class entities. RASA includes a formal, executable language for multi-agent protocol specification, which, in addition to specifying the order of messages using a process algebra, also allows designers to specify the rules and consequences of protocols using constraints. Rather than having hard-coded decision making mechanisms for choosing their next move, agents can inspect the protocol specification at runtime to do so. Such an approach would allow the agents to compose protocols at runtime, instead of relying on statically designed protocols. In this paper, we investigate the implications of protocol composition by examining the conditions under which composing existing legal protocols would lead to illegal protocols --- that is, protocols that can fail during execution through no fault of the participants. We precisely define what constitutes an illegal protocol, and present proof obligations about compositions that, when discharged, demonstrate that a composition is legal.

[1]  Tim Miller,et al.  Amongst First-Class Protocols , 2008, ESAW.

[2]  Maurizio Gabbrielli,et al.  Proving concurrent constraint programs correct , 1994, POPL '94.

[3]  Munindar P. Singh,et al.  A Modular Action Description Language for Protocol Composition , 2007, AAAI.

[4]  Steve Schneider The B-method - an introduction , 2001, The cornerstones of computing series.

[5]  Peter McBurney,et al.  Using Constraints and Process Algebra for Specification of First-Class Agent Interaction Protocols , 2006, ESAW.

[6]  Munindar P. Singh,et al.  OWL-P: A Methodology for Business Process Development , 2005, AOIS.

[7]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[8]  Munindar P. Singh,et al.  Reasoning about Commitments in the Event Calculus: An Approach for Specifying and Executing Protocols , 2004, Annals of Mathematics and Artificial Intelligence.

[9]  Benjamin C. Pierce,et al.  Types and programming languages: the next generation , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[10]  P. McBurney,et al.  Executable Logic for Reasoning and Annotation of First-Class Agent Interaction Protocols , 2007 .

[11]  David Stuart Robertson,et al.  Multi-agent Coordination as Distributed Logic Programming , 2004, ICLP.

[12]  J. Michael Spivey,et al.  The Z notation - a reference manual , 1992, Prentice Hall International Series in Computer Science.

[13]  Paul E. Dunne Prevarication in dispute protocols , 2003, ICAIL.