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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
