Compositional Verification of Multi-Agent Systems: A Formal Analysis of Pro-activeness and Reactiveness
暂无分享,去创建一个
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.
[1] Gerard Tel,et al. The derivation of distributed termination detection algorithms from garbage collection schemes , 1991, TOPL.
[2] Jan Treur,et al. Temporal Semantics of Compositional Task Models and Problem Solving Methods , 1999, Data Knowl. Eng..