The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed systems analysis with CCS
Distributed systems analysis with CCS
Readings in agents
Multiagent systems
Multiagent systems and societies of agents
Multiagent systems
Formal methods in DAI: logic-based representation and reasoning
Multiagent systems
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Communication and Concurrency
Formal Modeling of Agent-Based English Auctions Using Finite State Process Algebra
KES-AMSTA '07 Proceedings of the 1st KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
T-compound interaction and overhearing agents
ESAW'04 Proceedings of the 5th international conference on Engineering Societies in the Agents World
| Hi-index | 0.00 |
We present a formal framework that uses the π-calculus for modeling multiagent systems. A process algebra in general is a term algebra used as an abstract programming language that stresses the composition of processes by a small set of process operators. The π-calculus in particular allows one to express systems of processes that have changing communication structure. We explicate the agent abstraction as a π calculus process that persists through communication actions. Our principal task here is to show how the π-calculus can be used to model certain aspects that have already been specified for a major multiagent system. We also sketch how a π-calculus framework supports development activities in this context, and we suggest how various general aspects of multiagent systems may be modeled in this framework.