Abstract
Abstract Predictability is a very important feature of complex real-time systems. For a complex system involving a number of subsystems, the timing properties of each embedded system play an important role since the total system’s response depends on temporal behaviour of all the subsystems. In this paper, we analyze the timing properties of reactive programs written in a rule-based language RL. RL is a relatively simple rule language for programming discrete-response part of embedded applications in a layered architecture. It has been already used in a complex automotive application. We provide the upper timing bounds for RL programs executed using either of the two evaluation strategies developed earlier. In conclusion we provide some comments on the temporal behaviour of a layered system consisting of a reactive RL program combined with a set of periodic tasks.
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.
