Formal Modeling and Verification of a Rate-Monotonic Scheduling Implementation with Real-Time Maude

Rate-monotonic scheduling (RMS) is one of the most important real-time scheduling used in the industry. There are a large number of results about RMS, especially on its schedulability. However, the theoretical results do not contain enough details to be used directly for an industrial RMS implementation. On the other hand, the correctness of such an implementation is of the crucial importance. In this paper, we analyze a realistic RMS implementation by using real-time Maude, a formal modeling language and analysis tool based on rewriting logic. Overhead and some details of the hardware are taken into account in the model. We validate the schedulability and the correctness of the implementation within key scenarios. The soundness and the completeness of our approach are substantiated.

[1]  Giorgio C. Buttazzo,et al.  Rate Monotonic Analysis: The Hyperbolic Bound , 2003, IEEE Trans. Computers.

[2]  Michael Norrish,et al.  seL4: formal verification of an OS kernel , 2009, SOSP '09.

[3]  Lui Sha,et al.  Priority Inheritance Protocols: An Approach to Real-Time Synchronization , 1990, IEEE Trans. Computers.

[4]  Peter Csaba Ölveczky,et al.  Abstraction and Completeness for Real-Time Maude , 2006, WRLA.

[5]  Sudarshan K. Dhall,et al.  On a Real-Time Scheduling Problem , 1978, Oper. Res..

[6]  Gerard J. Holzmann,et al.  The Model Checker SPIN , 1997, IEEE Trans. Software Eng..

[7]  Luigi V. Mancini,et al.  Fault-Tolerant Rate-Monotonic First-Fit Scheduling in Hard-Real-Time Systems , 1999, IEEE Trans. Parallel Distributed Syst..

[8]  Cong Tian,et al.  Model Checking Rate Monotonic Scheduling Algorithm Based on Propositional Projection Temporal Logic: Model Checking Rate Monotonic Scheduling Algorithm Based on Propositional Projection Temporal Logic , 2011 .

[9]  Sang Hyuk Son,et al.  Enhancing fault-tolerance in rate-monotonic scheduling , 1994, Real-Time Systems.

[10]  John P. Lehoczky,et al.  An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems , 1992, [1992] Proceedings Real-Time Systems Symposium.

[11]  Tei-Wei Kuo,et al.  Load adjustment in adaptive real-time systems , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.

[12]  Sanjoy K. Baruah,et al.  Rate-Monotonic Scheduling on Uniform Multiprocessors , 2003, IEEE Trans. Computers.

[13]  A. Burns,et al.  Deadline monotonic scheduling theory and application , 1993 .

[14]  Narciso Martí-Oliet,et al.  Maude: specification and programming in rewriting logic , 2002, Theor. Comput. Sci..

[15]  Jay K. Strosnider,et al.  Engineering and Analysis of Fixed Priority Schedulers , 1993, IEEE Trans. Software Eng..

[16]  Zhenhua Duan,et al.  Time Constraints with Temporal Logic Programming , 2012, ICFEM.

[17]  Xavier Leroy,et al.  Formal verification of a realistic compiler , 2009, CACM.

[18]  John P. Lehoczky,et al.  The rate monotonic scheduling algorithm: exact characterization and average case behavior , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[19]  José Meseguer,et al.  Twenty years of rewriting logic , 2010, J. Log. Algebraic Methods Program..

[20]  Jay K. Strosnider,et al.  The Deferrable Server Algorithm for Enhanced Aperiodic Responsiveness in Hard Real-Time Environments , 1987, IEEE Trans. Computers.

[21]  Lui Sha,et al.  Aperiodic task scheduling for Hard-Real-Time systems , 2006, Real-Time Systems.

[22]  Daniel F. García,et al.  Utilization Bounds for Multiprocessor Rate-Monotonic Scheduling , 2004, Real-Time Systems.

[23]  Joseph Y.-T. Leung,et al.  On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.

[24]  Duan Zhen.  Model Checking Rate Monotonic Scheduling Algorithm Based on Propositional Projection Temporal Logic , 2011 .

[25]  José Meseguer,et al.  The rewriting logic semantics project: A progress report , 2011, Inf. Comput..

[26]  Yu Jiang,et al.  Design and Optimization of Multiclocked Embedded Systems Using Formal Techniques , 2015, IEEE Transactions on Industrial Electronics.

[27]  Daniel F. García,et al.  Minimum and maximum utilization bounds for multiprocessor rate monotonic scheduling , 2004, IEEE Transactions on Parallel and Distributed Systems.

[28]  Jay K. Strosnider,et al.  ENHANCED APERIODIC RESPONSIVENESS IN HARD REAL-TIME ENVIRONMENTS. , 1987, RTSS 1987.

[29]  Zhenhua Duan,et al.  Model Checking Rate-Monotonic Scheduler with TMSVL , 2014, 2014 19th International Conference on Engineering of Complex Computer Systems.

[30]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[31]  Peter Csaba Ölveczky,et al.  Semantics and pragmatics of Real-Time Maude , 2007, High. Order Symb. Comput..

[32]  Rami G. Melhem,et al.  Fault-Tolerant Rate-Monotonic Scheduling , 1998, Real-Time Systems.