{"title":"Predicting the response time of real-time rule-based programs with variable-expression assignments","authors":"Jeng-Rung Chen, A. Cheng","doi":"10.1109/TAI.1994.346477","DOIUrl":null,"url":null,"abstract":"Real-time expert systems are embedded decision systems which must respond to changes in the environments within stringent timing constraints. Given a program p, the response time analysis problem is to determine the maximal response time of p. In this paper, we tackle this problem with a response time upper bound algorithm for a class of EQL rule-based programs whose variables range over finite domains, This algorithm computes a response tame upper bound of the given program by determining the maximal number of rule firings which result from the firings of individual rules enabled at the invocation.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1994.346477","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Real-time expert systems are embedded decision systems which must respond to changes in the environments within stringent timing constraints. Given a program p, the response time analysis problem is to determine the maximal response time of p. In this paper, we tackle this problem with a response time upper bound algorithm for a class of EQL rule-based programs whose variables range over finite domains, This algorithm computes a response tame upper bound of the given program by determining the maximal number of rule firings which result from the firings of individual rules enabled at the invocation.<>