Automated Verification of Resource Requirements in Multi-Agent Systems Using Abstraction
- Cite this paper as:
- Alechina N., Logan B., Nguyen H.N., Rakib A. (2011) Automated Verification of Resource Requirements in Multi-Agent Systems Using Abstraction. In: van der Meyden R., Smaus JG. (eds) Model Checking and Artificial Intelligence. MoChArt 2010. Lecture Notes in Computer Science, vol 6572. Springer, Berlin, Heidelberg
We describe a framework for the automated verification of multi-agent systems which do distributed problem solving, e.g. query answering. Each reasoner uses facts, messages and Horn clause rules to derive new information. We show how to verify correctness of distributed problem solving under resource constraints, such as the time required to answer queries and the number of messages exchanged by the agents. The framework allows the use of abstract specifications consisting of Linear Time Temporal Logic (LTL) formulas to specify some of the agents in the system. We illustrate the use of the framework on a simple example.
Unable to display preview. Download preview PDF.