A Formal Proof of the Rate Monotonic Scheduler

  • Authors:

  • Dong Shuzhen;Xu Qiwen;Zhan Naijun

  • Affiliations:

  • -;-;-

  • Venue:
  • RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 formalized 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.