ECASL: a model of rational agency for communicating agents
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
On the semantics of conditional commitment
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
On the Semantics of Conditional Commitment
Agent Communication II
Conceptual Modeling: Foundations and Applications
Modeling mental states in the analysis of multiagent systems requirements
AOSE'06 Proceedings of the 7th international conference on Agent-oriented software engineering VII
Formal methods in agent-oriented software engineering
AOSE'10 Proceedings of the 10th international conference on Agent-oriented software engineering
A model of rational agency for communicating agents
AC'04 Proceedings of the 2004 international conference on Agent Communication
Modeling mental states in agent-oriented requirements engineering
CAiSE'06 Proceedings of the 18th international conference on Advanced Information Systems Engineering
| Hi-index | 0.00 |
In this thesis, we introduce a specification language (CASL) and verification environment (CASLve) for multiagent systems. We use the situation calculus [52] with Reiter's solution to the frame problem [62]—enhanced with predicates to describe agents' knowledge [64], beliefs, and goals—to formally, perspicuously, and systematically describe the effects of actions on the world and the mental states of agents. We add INFORM, REQUEST, and CANCELREQUEST actions to model inter-agent communication, and investigate properties of multiagent knowledge change and goal change, as well as belief change. We use the notation of the concurrent, logic programming language ConGolog [17] to specify the behaviour of agents. ConGolog has a formal semantics defined in the situation calculus, which facilitates the process of reasoning about the behaviour of individual agents and the system as a whole. We provide an environment for verifying properties of CASL specifications, by encoding the situation calculus, its extensions to handle mental states, and ConGolog in the PVS verification system [54], and proving lemmas which are useful for verifying CASL specifications. These include proving that bounded-loop ConGolog programs terminate, and providing a framework far compositional verification of ConGolog programs. We then specify three multiagent systems using CASL and prove some properties of the specifications.