Frontiers in Run-Time Prediction for the Production-System Paradigm

Efficient indexing schemes have influenced the acceptance of production systems in the industrial world. However, in embedded-control systems, production systems have not been applied intensively because of their nondeterministic run-time behavior. Thus, nonpredictability of response times is a major obstacle to the widespread use of expert systems in the real-time domain. The RETE and TREAT algorithms and their offspring play a major role in the implementation of efficient pattern-matching systems. Therefore, it is worthwhile to investigate run-time predictability for these match algorithms. This article presents three different schemes for estimating the time needed for operations in the production-system execution model.

[1]  Norbert Theuretzbacher,et al.  The Challenge of Real-Time Process Control for Production Systems , 1988, AAAI.

[2]  Charles L. Forgy,et al.  Rete: A Fast Algorithm for the Many Patterns/Many Objects Match Problem , 1982, Artif. Intell..

[3]  Milind Tambe,et al.  Collection oriented match , 1993, CIKM '93.

[4]  Allen Newell,et al.  SOAR: An Architecture for General Intelligence , 1987, Artif. Intell..

[5]  Thomas Mandl,et al.  A Parallel Production System Architecture , 1991, J. Parallel Distributed Comput..

[6]  Allen Newell,et al.  The effectiveness of task-level parallelism for high-level vision , 1989, PPOPP '90.

[7]  Timothy L. Trowbridge Book review: Rule Based Programming with OPS5 by Thomas A. Cooper and Nancy Wogrin (Morgan Kaufmann Pubtishers) , 1989, SGAR.

[8]  Allen Newell,et al.  Some Chunks Are Expensive , 1988, ML.

[9]  RamamrithamKrithi,et al.  What is predictability for real-time systems? , 1990 .

[10]  Anoop Gupta,et al.  Run-Time Prediction for Production Systems , 1992, AAAI.

[11]  John A. Stankovic,et al.  Real-time computing systems: the next generation , 1988 .

[12]  Anoop Gupta Parallelism in production systems , 1987 .

[13]  Anoop Gupta,et al.  Suitability of Message Passing Computers for Implementing Production Systems , 1988, AAAI.

[14]  Franz Barachini Match-Time Predictability in Real-Time Production Systems , 1990, Expert Systems in Engineering.

[15]  Tambe,et al.  Uni-Rete : specializing the Rete match algorithm for the unique-attribute representation , 1991 .

[16]  Jay K. Strosnider,et al.  Reducing problem-solving variance to improve predictability , 1991, CACM.

[17]  Rudolph E. Seviora,et al.  A Multiprocessor Architecture for Production System Matching , 1987, AAAI.

[18]  Albert Mo Kim Cheng,et al.  MRL: a real-time rule-based production system , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[19]  Charles L. Forgy,et al.  Rete: a fast algorithm for the many pattern/many object pattern match problem , 1991 .

[20]  Daniel P. Miranker TREAT: A new and efficient match algorithm for AI production systems , 1988 .

[21]  Peter H. M. Klein,et al.  The Safety-Bag Expert System in the Electronic Railway Interlocking System ELEKTRA , 1991 .

[22]  Toru Ishida,et al.  Parallel Rule Firing in Production Systems , 1991, IEEE Trans. Knowl. Data Eng..

[23]  Franz Barachini The evolution of PAMELA , 1991 .

[24]  Allen Newell,et al.  Parallel algorithms and architectures for rule-based systems , 1986, ISCA '86.

[25]  Nancy Wogrin,et al.  Rule-Based Programming With Ops 5 , 1988 .

[26]  Ho Soo Lee,et al.  Advances in Rete Pattern Matching , 1986, AAAI.

[27]  Milind Tambe Eliminating combinatorics from production match , 1991 .

[28]  Makoto Yokoo,et al.  Organization Self-Design of Distributed Production Systems , 1992, IEEE Trans. Knowl. Data Eng..

[29]  Daniel P. Miranker,et al.  On the Performance of Lazy Matching in Production Systems , 1990, AAAI.