Optimization of Rule-Based Systems Using State Space Graphs
IEEE Transactions on Knowledge and Data Engineering
Measuring the Structural Complexity of OPS5 Rule-Based Programs
COMPSAC '96 Proceedings of the 20th Conference on Computer Software and Applications
A Graph-Based Approach for Timing Analysis and Refinement of OPS5 Knowledge-Based Systems
IEEE Transactions on Knowledge and Data Engineering
Optimizing Real-Time Equational Rule-Based Systems
IEEE Transactions on Software Engineering
Shortening Matching Time in OPS5 Production Systems
IEEE Transactions on Software Engineering
Self-Stabilizing Real-Time OPS5 Production Systems
IEEE Transactions on Knowledge and Data Engineering
Verifying Resource Requirements for Distributed Rule-Based Systems
RuleML '08 Proceedings of the International Symposium on Rule Representation, Interchange and Reasoning on the Web
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
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
| Hi-index | 0.00 |
This paper focuses on the response time analysis problem: the problem of determining a priori the maximal response time or response time upper bound of a given program. We study this problem in the context of OPS5 production systems. The response time of a program is investigated in two respects: the maximal number of rule firings and the maximal number of basic comparisons made by the Rete network during the execution. The execution of a program always terminates in bounded time if this program satisfies one of certain conditions. The present four of these conditions for OPS5 production systems. An algorithm used to compute an upper bound on the number of rule firings is given. Furthermore, to have a better idea on the time required during the execution, we present an algorithm to compute the maximal time required during the match phase in terms of the number of comparisons made by the Rete network.