Representing and executing agent-based systems
ECAI-94 Proceedings of the workshop on agent theories, architectures, and languages on Intelligent agents
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
2APL: a practical agent programming language
Autonomous Agents and Multi-Agent Systems
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Specifying and verifying a MAS: the robots on mars case study
ProMAS'07 Proceedings of the 5th international conference on Programming multi-agent systems
Goal decomposition tree: an agent model to generate a validated agent behaviour
DALT'05 Proceedings of the Third international conference on Declarative Agent Languages and Technologies
ProMAS'05 Proceedings of the Third international conference on Programming Multi-Agent Systems
Specifying and verifying holonic agents with GDT4MAS
International Journal of Agent-Oriented Software Engineering
Specifying recursive agents with GDTs
Autonomous Agents and Multi-Agent Systems
| Hi-index | 0.00 |
The Goal Decomposition Tree model has been introduced in 2005 by Mermet et al. [9] to specify and verify the behaviour of an agent evolving in a dynamic environment. This model presents many interesting characteristics such as its compositional aspect and the definition of proven proof schemas making the proof mechanism reliable. Being interested in specifying and verifying multiagent systems, we have decided to extend the GDT model for specifying Multiagent systems. The object of this article is to present this extension. So, after a brief description of the initial GDT model, we show how we extend it by introducing the specification of the whole MAS. We also introduce the notions of agent type and agent, and we show how external goals allow to specify collaborative agents and to prove the correctness of their collaboration. These notions are illustrated on a toy example of the litterature.