Artificial intelligence and mathematical theory of computation
Proving properties of states in the situation calculus
Artificial Intelligence
Features and fluents (vol. 1): the representation of knowledge about dynamical systems
Features and fluents (vol. 1): the representation of knowledge about dynamical systems
Compositional Design and Verification of a Multi-Agent System for One-to-Many Negotiation
ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems
Organization Models and Behavioral Requirements Specification for Multi-Agent Systems
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
A Truly Concurrent Model for Interacting Agents
PRIMA 2001 Proceedings of the 4th Pacific Rim International Workshop on Multi-Agents, Intelligent Agents: Specification, Modeling, and Applications
Hi-index | 0.00 |
To make verification a manageable part of the system development process, comprehensibility and reusability of properties and proofs is essential. The work reported in this paper contributes formally founded methods that support proof structuring and reuse. Often occurring patterns in agent behaviour can be exploited to establish a library containing properties and proofs. This is illustrated here by verifying the class of single agents acting in dynamic environments. First, a notion of abstraction for properties and proofs is introduced that provides means to structure and clarify verification. Also, the paper contributes to establishing the library by proposing a reusable system of generic co-ordination properties for applications of agents acting in dynamic environments.