ACM Transactions on Programming Languages and Systems (TOPLAS)
The Gaia Methodology for Agent-Oriented Analysis and Design
Autonomous Agents and Multi-Agent Systems
Revised Papers from the International Workshop on Infrastructure for Multi-Agent Systems: Infrastructure for Agents, Multi-Agent Systems, and Scalable Multi-Agent Systems
Automated Derivation of Complex Agent Architectures from Analysis Specifications
AOSE '01 Revised Papers and Invited Contributions from the Second International Workshop on Agent-Oriented Software Engineering II
Image Compression Using Weighted Finite Automata
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Semantics of declarative goals in agent programming
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
From Glushkov WFAs to rational expressions
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Specifying and verifying a MAS: the robots on mars case study
ProMAS'07 Proceedings of the 5th international conference on Programming multi-agent systems
Specifying and verifying holonic agents with GDT4MAS
International Journal of Agent-Oriented Software Engineering
A novel approach to programming: agent based software engineering
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part III
| Hi-index | 0.00 |
In order to provide an effective tool allowing to implement validated agents behaviours, this paper first presents a Goal Decomposition Tree (GDT), a model to specify behaviours both in procedural and declarative ways. A GDT allows the designer to verify the specified behaviour. This model is then used to generate a behaviour automaton using automata composition patterns associated to operators used in the tree. This process allows to obtain a finite expression representing all valid behaviours of agents of a MAS.