A methodology for the construction of scheduled systems

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


Published in:
Formal Techniques in Real-Time and Fault-Tolerant Systems. 6th International Symposium, FTRTFT 2000. Proceedings (Lecture Notes in Computer Science Vol.1926), 106 - 20
Presented at:
Formal Techniques in Real-Time and Fault-Tolerant Systems. 6th International Symposium, FTRTFT 2000. Proceedings (Lecture Notes in Computer Science Vol.1926), Berlin, Germany
Year:
2000
Keywords:
Laboratories:




 Record created 2013-03-14, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)