Communicating sequential processes
Communicating sequential processes
The Z notation: a reference manual
The Z notation: a reference manual
Object-oriented development: the fusion method
Object-oriented development: the fusion method
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
A methodology and modelling technique for systems of BDI agents
MAAMAW '96 Proceedings of the 7th European workshop on Modelling autonomous agents in a multi-agent world : agents breaking away: agents breaking away
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
A Calculus of Communicating Systems
A Calculus of Communicating Systems
ROADMAP: extending the gaia methodology for complex open systems
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
The Gaia Methodology for Agent-Oriented Analysis and Design
Autonomous Agents and Multi-Agent Systems
On Kleene Algebras and Closed Semirings
MFCS '90 Proceedings of the Mathematical Foundations of Computer Science 1990
Mastering Regular Expressions
Developing multiagent systems: The Gaia methodology
ACM Transactions on Software Engineering and Methodology (TOSEM)
Tropos: An Agent-Oriented Software Development Methodology
Autonomous Agents and Multi-Agent Systems
| Hi-index | 0.00 |
The Gaia methodology is a development methodology for multi-agent systems that uses the concept of roles to define behaviour. Gaia uses liveness expressions, which are expressions written in a formal syntax that are used to define the ongoing behaviour of a role; and liveness rules, which are expressions specifying the behaviour of roles relative to each other in a system. However, while the syntax is formal, a formal semantics has not been defined, and there is no theory for how to reason about and manipulate these expressions. In this paper, we present a formal semantics for liveness rules and expressions, and discuss our work in developing axioms about them. We also discuss the introduction of a new operator for defining the complement of expressions; that is, the behaviour that falls outside of the liveness expression. This provides more flexibility when reasoning about and manipulating these expressions.