Cooperating automata is a model which represents the coordination of agents in distributed systems using three basic elements: states, actions and groups of agents. A system can be viewed as a high-level Petri net in which tokens are active elements consisting of an automation together with a private memory. In this paper we introduce a brief presentation of the model, showing that it is powerful enough to represent other formalisms of distributed agents, e.g. the team automata of C.A. Ellis. Finally, we extend the model of cooperating automata in order to allow the idea of agent geographical location, by introducing the concept of integer attribute.
[1]
David Walker,et al.
Objects in the pi-Calculus
,
1992,
Inf. Comput..
[2]
Javier Oliver,et al.
Opject-Oriented Specification with the Parallel Multi-Label-Selective lambda-Calculus
,
1999,
SOFSEM.
[3]
James Lyle Peterson,et al.
Petri net theory and the modeling of systems
,
1981
.
[4]
Clarence A. Ellis.
Team automata for groupware systems
,
1997,
GROUP '97.
[5]
Richard M. Karp,et al.
Parallel Program Schemata
,
1969,
J. Comput. Syst. Sci..
[6]
Andrew Tokmakoff,et al.
Modelling Dynamic Agent Systems with Cooperating Automata
,
1999,
PDPTA.