CPS Real-Time, CPS Embedded Control
Date of this Version
Proceedings of the 14th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS '08)
For embedded control systems, a schedule for the allocation of resources to a software component can be described by an infinite word whose ith symbol models the resources used at the ith sampling interval. Dependency of performance on schedules can be formally modeled by an automaton (w-regular language) which captures all the schedules that keep the system within performance requirements. We show how such an automaton is constructed for linear control designs and exponential stability or settling time performance requirements. Then, we explore the use of the automaton for online scheduling and for schedulability analysis. As a case study, we examine how this approach can be applied for the LQG control design. We demonstrate, by examples, that online schedulers can be used to guarantee performance in worst-case condition together with good performance in normal conditions. We also provide examples of schedulability analysis.
© 2008 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Rajeev Alur and Gera Weiss, "Regular Specifications of Resource Requirements for Embedded Control Software", Proceedings of the 14th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS '08) , 159-168. April 2008. http://dx.doi.org/10.1109/RTAS.2008.13
Date Posted: 11 July 2012