Efficient response time bound analysis of real-time rule-based systems

It is required not only to verify the logical correctness of a real-time expert system but also to determine whether the computation time required to compute a logically correct decision in each monitor-decide cycle is within the imposed timing constraint. A principal concept in the analysis methodology is that of a special form of rules. A set of rules satisfying all behavioral constraint assertions of a special form is guaranteed to have bounded response time. The authors present efficient algorithms for computing tight response time bounds for rule sets with bounded response time. These algorithms use techniques which do not involve checking the state-space graph corresponding to the rule sets.<>