Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Real-time knowledge-based systems
AI Magazine
Concepts, methods, and languages for building timely intelligent systems
Real-Time Systems
Fundamental properties of deterministic and nondeterministic extensions of Datalog
Selected papers of the workshop on Deductive database theory
Intelligent real-time control of robotic vehicles
Communications of the ACM
Behavior of database production rules: termination, confluence, and observable determinism
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Timing analysis of MRL: a real-time rule-based system
Real-Time Systems - Special issue: Real-time languages and language-level timing tools and analysis
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Parallel Rule Firing in Production Systems
IEEE Transactions on Knowledge and Data Engineering
Analysis of Real-Time Rule-Based Systems with Behavioral Constraint Assertions Specified in Estella
IEEE Transactions on Software Engineering
Deriving Production Rules for Incremental View Maintenance
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Effects of Database Size on Rule System Performance: Five Case Studies
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
A distributed expert system for space shuttle flight control
A distributed expert system for space shuttle flight control
Reducing match time variance in production systems with HAL
CIKM '97 Proceedings of the sixth international conference on Information and knowledge management
Optimization of Rule-Based Systems Using State Space Graphs
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Applying a Modified EQL Optimization Method to MRL Rule-Based Programs
ASSET '98 Proceedings of the 1998 IEEE Workshop on Application - Specific Software Engineering and Technology
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
Self-Stabilizing Real-Time OPS5 Production Systems
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
Real-time rule-based expert systems are embedded decision systems that must respond to changes in the environments within stringent timing constraints. Given a program p, the response time analysis problem is to determine the response time of p. This problem consists of 1) determining whether or not the execution of p always terminates in bounded time, and 2) computing the maximal execution time of p.The EQuational Logic (EQL) language is a simple language designed for real-time applications. It has been proved by Mok that the response time analysis problem is undecidable if the program variables have infinite domains, and is PSPACE-hard in the case where all of the variables have finite domains. However, we have observed that the use of a simple syntactic and semantic check on programs coupled with other techniques such as state space graph checks can dramatically reduce the time needed in the analysis. There are sets of syntactic and semantic constraint assertions such that if the set S of rules satisfies any of them, then the execution of S always terminates in bounded time. Each of these sets of syntactic and semantic constraint assertions is called a Special Form.The focus of this paper is on proving the existence of two Special Forms and determining tight response time upper bounds of EQL rule-based programs. For each known Special Form, an algorithm used to calculate the maximal response time of programs satisfying this Special Form is presented. Additionally, to enhance the applicability of the proposed algorithms, we show how the General Analysis Algorithm can be used with these algorithms.