COMPOSITIONAL VERIFICATION OF MULTI-AGENT SYSTEMS: A FORMAL ANALYSIS OF PRO-ACTIVENESS AND REACTIVENESS

1 March 2002

journal article
research article
Published by World Scientific Pub Co Pte Ltd in International Journal of Cooperative Information Systems

Vol. 11 (01n02) , 51-91
https://doi.org/10.1142/s0218843002000480

Abstract

A compositional method is presented for the verification of multi-agent systems. The advantages of the method are the well-structuredness of the proofs and the reusability of parts of these proofs in relation to reuse of components. The method is illustrated for an example multi-agent system, consisting of co-operative information gathering agents. This application of the verification method results in a formal analysis of pro-activeness and reactiveness of agents, and shows which combinations of pro-activeness and reactiveness in a specific type of information agents lead to a successful cooperation.

Keywords

This publication has 3 references indexed in Scilit:

Temporal semantics of compositional task models and problem solving methods
Data & Knowledge Engineering, 1999
Compositional verification of a distributed real-time arbitration protocol
Real-Time Systems, 1994
The derivation of distributed termination detection algorithms from garbage collection schemes
ACM Transactions on Programming Languages and Systems, 1993