Model checking
MOCHA: Modularity in Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Predicting the response time of OPS5-style production systems
CAIA '95 Proceedings of the 11th Conference on Artificial Intelligence for Applications
A Graph-Based Approach for Timing Analysis and Refinement of OPS5 Knowledge-Based Systems
IEEE Transactions on Knowledge and Data Engineering
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
Model-checking memory requirements of resource-bounded reasoners
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
Rule-based systems are rapidly becoming an important component of `mainstream' computing technologies, for example in business process modelling, the semantic web, sensor networks etc. However, while rules provide a flexible way of implementing such systems, the resulting system behaviour and the resources required to realise it can be difficult to predict. In this paper we consider the verification of system behaviour and resource requirements for distributed rule-based systems. More specifically, we consider distributed problem-solving in systems of communicating rule-based systems, and ask how much time (measured as the number of rule firings) and message exchanges does it take the system to find a solution. We show how standard model-checking technology can be used to verify resource requirements for such systems, and present preliminary results which highlight complex tradeoffs between time and communication bounds.