We study a methodology for constructing scheduled systems by restricting successively the behavior of the processes to be scheduled. Restriction is used to guarantee the satisfaction of two types of constraints: schedulability constraints characterizing timing properties of the processes, and constraints characterizing particular scheduling algorithms including process priorities, non-idling, and preemption. The methodology is based on a controller synthesis paradigm. The main results deal with the characterization of scheduling policies as safety constraints and the simplification of the synthesis process by applying a composability principle.
CITATION STYLE
Altisen, K., Gößler, G., & Sifakis, J. (2000). A methodology for the construction of scheduled systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1926, pp. 106–120). Springer Verlag. https://doi.org/10.1007/3-540-45352-0_11
Mendeley helps you to discover research relevant for your work.