The deadline-driven scheduler of Liu and Layland  is considered in this chapter. The main idea of the scheduler was given in Chap. 1. The correctness proof for the deadline-driven scheduler will be carried out carefully to illustrate that the proof theory of the previous two chapters can manage a nontrivial proof. The steps of the proof wil not, however, be given in as much detail as in the previous chapters and we shall omit some simple steps and annotations that we have described earlier.
KeywordsClosed Interval Open Interval Processor Time Inductive Step Real Arithmetic
Unable to display preview. Download preview PDF.