MOCHA: Modularity in Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Verifying space and time requirements for resource-bounded agents
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Verifying time, memory and communication bounds in systems of reasoning agents
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Knowing Minimum/Maximum n Formulae
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Modal logics for communicating rule-based agents
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Model-checking memory requirements of resource-bounded reasoners
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Editorial: Introduction: Special Issue on Distributed Constraint Satisfaction
Artificial Intelligence - Special issue: Distributed constraint satisfaction
On the computational complexity of coalitional resource games
Artificial Intelligence
On communication in solving distributed constraint satisfaction problems
CEEMAS'05 Proceedings of the 4th international Central and Eastern European conference on Multi-Agent Systems and Applications
MCMAS: a model checker for multi-agent systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Automated verification of resource requirements in multi-agent systems using abstraction
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
Verifying resource requirements for ontology-driven rule-based agents
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
| Hi-index | 0.00 |
We present a framework for the automated verification of time and communication requirements in systems of distributed rule-based reasoning agents which allows us to determine how many rule-firing cycles are required to solve the problem, how many messages must be exchanged, and the trade-offs between the time and communication resources. We extend CTL* with belief and communication modalities to express bounds on the number of messages the agents can exchange. The resulting logic, $\mathcal{L}_{CRB}$, can be used to express both bounds on time and on communication. We provide an axiomatisation of the logic and prove that it is sound and complete. Using a synthetic but realistic example system of rule-based reasoning agents which allows the size of the problem and the distribution of knowledge among the reasoners to be varied, we show the Mocha model checker [1] can be used to encode and verify properties of systems of distributed rule-based agents. We describe the encoding and report results of model checking experiments which show that even simple systems have rich patterns of trade-offs between time and communication bounds.