A Formal Proof of the Rate Monotonic Scheduler

We formally prove Liu and Layland's classic theorem on the Rate Monotonic Scheduler in Duration Calculus, a real time interval temporal logic. We describe the assumption of the system, the scheduling policy, the requirement, i.e., service is met for the processes before their deadlines, all by Duration Calculus formulae. That a feasibility condition is sufficient is formalised as logical implication. By using the proof system of Duration Calculus, we formally prove that the feasibility condition due to Liu and Layland is sufficient. Dong Shuzhen was a fellow of UNU/IIST between February 1999 and July 1999. Xu Qiwen is a Research Fellow of UNU/IIST. His research interest is in Formal Techniques of Programming, including concurrency, verification, and design calculi. E-mail: [email protected] Zhan Naijun was a fellow of UNU/IIST between July 1998 and August 1999, on leave from Institute of Software, Chinese Academy of Sciences, where he is a PhD student. Email: [email protected] Copyrigh..