A calculus of mobile processes, I
Information and Computation
A calculus of mobile processes, II
Information and Computation
Evolution of the GPGP/TÆMS domain-independent coordination framework
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Distributed problem solving and planning
Mutli-agents systems and applications
A type system for lock-free processes
Information and Computation - IFIP TCS2000
Autonomous Agents and Multi-Agent Systems
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
On Bisimulations for the Asynchronous pi-Calculus
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Minimizing communication cost in a distributed Bayesian network using a decentralized MDP
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Decentralized Markov Decision Processes with Event-Driven Interactions
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
ACVisualizer: A visualization tool for APi-calculus
Multiagent and Grid Systems
Performance evaluation of DPS coordination strategies modelled in pi-calculus
International Journal of Intelligent Information and Database Systems
| Hi-index | 0.00 |
A key issue for distributed problem solving (DPS) systems is coordination of the agent's actions, and methods for producing effective coordination strategies remain an active area of research. Because there are not yet approaches that can automatically produce such strategies, some human engineering is often still necessary. As a result, there is a need for a formal tool to support such human engineering. In a previous work (Khorasani et al., 2009), we investigated the use of pi-calculus as a formal language for modelling DPS coordination strategies and showed how such models could be used to evaluate the time performance of a strategy. In this paper, we focus on verification of coordination strategies. More specifically, we utilise the formal semantics of pi-calculus to detect deadlocks in a coordination strategy. We also show how, by imposing certain constraints on the pi-calculus model, one would be able to design a deadlock-free coordination strategy.