Verification of protocols for automated negotiation
Shamimabi Paurobally, Jim Cunningham · 2002
Abstract. This paper presents the verifying aspect of our work for verified, unambiguous and sharable protocols with desirable properties to facilitate automated negotiation. A protocol is represented as an abstract theory in a multi-modal meta-language, called ANML, thereby enabling the verification and proof of certain protocol correctness properties. Furthermore, such logical theories allow the use of AI techniques for reasoning about goal satisfaction. The two case studies discussed in this paper are two protocols proposed in FIPA AUML, [11], which can be shown to contain errors by using our framework. We provide improved representations in ANML and when possible in AUML. 1