Abstract
Efficient match algorithms have influenced the acceptance of production systems in the industrial world. However, in embedded control systems they have not been applied intensively because of their non-deterministic run-time behavior. Until recently no method was known yielding rigorous upper bounds for run-time on match algorithms. Although the already published MLR (Micro Level Reasoner) method yields very good run-time estimations for basic actions in the RETE match algorithm it can only be applied to soft real-time problems. We present the UB (Upper Bound) and EUB (Extended Upper Bound) methods which in contrast to MLR guarantee accurate upper bounds for basic actions in RETE or TREAT match algorithms. Hence, both algorithms can be applied to solving hard real-time problem in a limited way. >
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.
