Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.5555/1558013.1558083 | AAMAS (1) |
Keywords | Field | DocType |
proven proof,goal decomposition tree model,gdt model,multiagent system,agent type,initial gdt model,collaborative agent,compositional aspect,brief description,proof mechanism,specification,temporal logic,verification,multiagent systems | Computer science,Decomposition tree,Correctness,Multi-agent system,Artificial intelligence,Temporal logic,Schema (psychology) | Conference |
Citations | PageRank | References |
5 | 0.48 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bruno Mermet | 1 | 51 | 10.12 |
| Gaële Simon | 2 | 22 | 6.12 |