By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. M. K. Cheng ; Dept. of Comput. Sci., Houston Univ., TX, USA ; C. -H. Chen

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

Published in:

Computer Assurance, 1992. COMPASS '92. 'Systems Integrity, Software Safety and Process Security: Building the System Right.', Proceedings of the Seventh Annual Conference on

Date of Conference:

15-18 Jun 1992