Scheduling real-time systems with periodic tasks using a model-checking approach

Scheduling theory presents analytical solutions for different scheduling schemes, most of which based on necessary or sufficient conditions only. Available methods based on graphs use quantitative temporal reasoning to answer about decidability and to find feasible schedules. In this paper we present an alternative technique based on model-checking approach that uses only qualitative temporal reasoning with periodic tasks only. That technique gives a necessary and sufficient condition for decidability and assists the design of feasible static or quasistatic offline schedulers. Prospective results are illustrated by an example where a feasible solution can be reached dealing with aceptable computational complexity.

[1]  Miguel Felder,et al.  Verification of real-time designs: combining scheduling theory with automatic formal verification , 1999, ESEC/FSE-7.

[2]  David Lorge Parnas,et al.  Scheduling Processes with Release Times, Deadlines, Precedence, and Exclusion Relations , 1990, IEEE Trans. Software Eng..

[3]  Enrico Vicario,et al.  Static Analysis and Dynamic Steering of Time-Dependent Systems , 2001, IEEE Trans. Software Eng..

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

[5]  Joseph Sifakis,et al.  A framework for scheduler synthesis , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).

[6]  Oded Maler,et al.  Task graph scheduling using timed automata , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[7]  F. Vernadat,et al.  The tool TINA – Construction of abstract state spaces for petri nets and time petri nets , 2004 .

[8]  Howard Falk,et al.  Formal Verification of Timed Systems: A Survey and Perspective , 2004, Proc. IEEE.

[9]  Olivier Roux,et al.  A T-time Petri net extension for real-time task scheduling modeling , 2002 .

[10]  A. Prasad Sistla,et al.  Quantitative temporal reasoning , 1990, Real-Time Systems.

[11]  Herbert S. Wilf,et al.  Algorithms and Complexity , 1994, Lecture Notes in Computer Science.

[12]  Alan Burns,et al.  Real-Time System Scheduling , 1995 .

[13]  Stavros Tripakis,et al.  The Tool KRONOS , 1996, Hybrid Systems.

[14]  Krithi Ramamritham,et al.  Preemptive Scheduling Under Time and Resource Constraints , 1987, IEEE Transactions on Computers.

[15]  Sérgio Vale Aguiar Campos,et al.  Verus: A Tool for Quantitative Analysis of Finite-State Real-Time Systems , 1995, Workshop on Languages, Compilers, & Tools for Real-Time Systems.

[16]  P. Merlin,et al.  Recoverability of Communication Protocols - Implications of a Theoretical Study , 1976, IEEE Transactions on Communications.

[17]  Petru Eles,et al.  Quasi-static scheduling for multiprocessor real-time systems with hard and soft tasks , 2005, 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05).

[18]  Alan Burns,et al.  Real-Time Systems and Programming Languages , 2009 .

[19]  Enrico Vicario,et al.  Modeling flexible real time systems with preemptive time Petri nets , 2003, 15th Euromicro Conference on Real-Time Systems, 2003. Proceedings..

[20]  Laura Carnevali,et al.  Oris: a tool for modeling, verification and evaluation of real-time systems , 2010, International Journal on Software Tools for Technology Transfer.

[21]  Tomohiro Yoneda,et al.  CTL Model Checking of Time Petri Nets Using Geometric Regions , 1998 .