Performance evaluation of DPS coordination strategies modelled in pi-calculus Online publication date: Wed, 16-Dec-2009
by Elham S. Khorasani, Norman Carver, Shahram Rahimi
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 3, No. 4, 2009
Abstract: 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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Information and Database Systems (IJIIDS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com