A calculus of mobile processes, I
Information and Computation
A calculus of mobile processes, II
Information and Computation
A branch and bound algorithm for the job-shop scheduling problem
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Pict: a programming language based on the Pi-Calculus
Proof, language, and interaction
Performance Evaluation of Mobile Processes via Abstract Machines
IEEE Transactions on Software Engineering
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Distributed problem solving and planning
Mutli-agents systems and applications
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
Evolution of the GPGP/TÆMS Domain-Independent Coordination Framework
Autonomous Agents and Multi-Agent 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
Modeling and analysis of multi-agent systems based on π-calculus
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Deadlock verification of a DPS coordination strategy and its alternative model in pi-calculus
International Journal of Intelligent Information and Database Systems
| Hi-index | 0.00 |
Distributed problem solving (DPS) is the subfield of multi-agent systems concerned with using systems of agents to solve large-scale, distributed problems like data interpretation in sensor networks. Coordination of agent actions is a key issue in DPS. There are not yet methods that can automatically produce effective coordination strategies for most real-world applications. We envision a tool that would support human engineering by allowing a strategy to be modelled at various levels of abstraction, with incomplete specification of the inter- and intra-agent order of actions. The tool would be able to analyse various properties of such strategies, determine the best possible time performance, and derive ordering constraints to guarantee best performance. This paper reports on research to develop key elements for such a tool, including using pi-calculus as a formal framework for defining DPS coordination strategies, and techniques for evaluating the time performance of such strategies defined with pi-calculus.