This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Response-Time Bounds of EQL Rule-Based Programs Under Rule Priority Structure
July 1995 (vol. 21 no. 7)
pp. 605-614
A key index of the performance of a rule-based program used in real-time monitoring and control is its response time, defined by the longest program execution time before a fixed point of the program is reached from a start state. Previous work in computing the response-time bounds for rule-based programs effectively assumes that all rules take the same amount of firing time. It is also assumed that if two rules are enabled, then either one of them may be scheduled first for firing. These assumptions can result in loose bounds, especially in the case programmers choose to impose a priority structure on the set of rules. In this paper, we remove the uniform-firing-cost assumption and discuss how to get tighter bounds by taking rule-priority information into account. We show that the rule-suppression relation we previously introduced can be extended to incorporate rule-priority information. A bound-derivation algorithm for programs whose potential-trigger relations satisfy an acyclicity condition is presented, followed by its correctness proof and an analysis example.

[1] M. Benda,“Real-time applications of AI in the aerospace industry,” Presentation at the Fall School on Artificial Intelligence. The Research Institute of Ecole Normal Supérieure, France, Sept. 1987.
[2] A.M.K. Cheng,“EQL: A rule-based language for programming real-time decision systems,” Technical Report, Dept. of Computer Sciences, Univ. of Texas at Austin, Mar. 1989.
[3] A.M.K. Cheng, J.C. Browne, A.K. Mok, and R.-H. Wang, "Analysis of Real-Time Rule-Based System with Behavioral Constraint Assertions Specified in Estella," IEEE Trans. Software Eng., vol. 19, no. 9, pp. 863-885, Sept. 1993.
[4] A.M.K. Cheng and C.-H. Chen,“Efficient response time bound analysis of real-time rule-based systems,” Proc. IEEE COMPASS’92, June 1992.
[5] A. Garvey and V. Lesser,“A survey of research in deliberative real-time artificial intelligence,” Real-Time Systems J., vol. 6, no. 3, May 1994.
[6] J. Hendler and A. Agrawala,“Mission critical planning: AI on the MARUTI real-time operating system,” Proc. Workshop on Innovative Approaches to Planning, Scheduling and Control, pp. 77-84, Nov. 1990.
[7] A.K. Mok,“Formal analysis of real-time equational rule-based systems,” Proc. 10th Real-Time Systems Symp., Dec. 1989.
[8] A.K. Mok,R.P. Amerasinghe,M. Chen,, and K. Tantisirivat,“Evaluating tight execution time bounds of programs by annotations,” Proc. Sixth Workshop on Real-Time Operating Systems and Software,Pittsburgh, Penn., May 1989.
[9] D.J. Musliner, E. Durfee, and K. Shin, “CIRCA: A Cooperative Intelligent, Real Time Control Architecture,” IEEE Trans. Systems, Man, and Cybernetics, vol. 23, pp. 1561-1574, 1993.
[10] C.J. Paul,A. Acharya,B. Black, and J.K. Strosnider,"Reducing problem solving variance to improve predictability," Comm. ACM, vol. 34, no. 8, pp. 81-93, Aug. 1991.
[11] C.-K. Wang and A.K. Mok, "Timing Analysis of MRL: A Real-Time Rule-Based System," J. Real-Time Systems, vol. 5, no. 1, pp. 89-128, Mar. 1993.
[12] R.-H. Wang and A.K. Mok,“Deriving response-time bounds for equational rule-based programs,” Proc. Int’l Computer Symp.,Taiwan, R.O.C., Dec. 1992.

Index Terms:
Real-time decision systems, rule-based systems, timing analysis, priority, algorithm.
Citation:
Rwo-Hsi Wang, Aloysius K. Mok, "Response-Time Bounds of EQL Rule-Based Programs Under Rule Priority Structure," IEEE Transactions on Software Engineering, vol. 21, no. 7, pp. 605-614, July 1995, doi:10.1109/32.392981
Usage of this product signifies your acceptance of the Terms of Use.