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

Franz Barachini

Abstract


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.

Full Text:

PDF


DOI: http://dx.doi.org/10.1609/aimag.v15i3.1099

Copyright © 2014, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.