Distributed Evolving Algebras

In this section we consider multi-agent computations. We do not suppose that agents are deterministic or do only a bounded amount of work at each step. The program of an agent may be any program described above.

Agents may share functions, and it is convenient [GR] to assume that all states of all agents share the same carrier; see the end of 3.2.4 in this connection.

• The Self Function
• Basic Definition of Distributed Ealgebras
  • Cooperative Actions
• Generalizations
  • Active Agents
  • Active Teams
• Sequential Runs
  • Stages
  • Quasi-sequential Runs
• Partially Ordered Runs
  • Runs
• Real-time Computations