Nonmonotonic logic and temporal projection
Artificial Intelligence
Theory for coordinating concurrent hierarchical planning agents using summary information
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Dynamic Logic
On Kleene Algebras and Closed Semirings
MFCS '90 Proceedings of the Mathematical Foundations of Computer Science 1990
Annals of Mathematics and Artificial Intelligence
Annotation and matching of first-class agent interaction protocols
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Re-use of interaction protocols for agent-based control applications
AOSE'02 Proceedings of the 3rd international conference on Agent-oriented software engineering III
Using constraints and process algebra for specification of first-class agent interaction protocols
ESAW'06 Proceedings of the 7th international conference on Engineering societies in the agents world VII
The role of the environment in agreement technologies
Artificial Intelligence Review
Efficient storage and retrieval in agent protocol libraries using subsumption hierarchies
Multiagent and Grid Systems
A survey of flexible agent interaction approaches
Multiagent and Grid Systems
| Hi-index | 0.00 |
For an agent to intelligently use specifications of executable protocols, it is necessary that the agent can quickly and correctly assess the outcomes of that protocol if it is executed. In some cases, this information may be attached to the specification; however, this is not always the case. In this paper, we present an algorithm for deriving characterisations of protocols. These characterisations specify the preconditions under which the protocol can be executed, and the outcomes of this execution. The algorithm is applicable to definitions with infinite iteration, and recursive definitions that terminate. We prove how a restricted subset of non-terminating recursive protocols can be characterised by rewriting them into equivalent non-recursive definitions before characterisation. We then define a method for matching protocols from their characterisations. We prove that the complexity of the matching method is less than for methods such as a depth-first search algorithm. Our experimental evaluation confirms this.