Symbolic Computation of Schedulability Regions Using Parametric Timed Automata

In this paper, we address the problem of symbolically computing the region in the parameter's space that guarantees a feasible schedule, given a set of real-time tasks characterised by a set of parameters and by an activation pattern. We make three main contributions. First, we propose a novel and general method, based on parametric timed automata. Second, we prove that the algorithm terminates for the case of periodic processes with bounded offsets. Third, we provide an implementation based on the use of symbolic model checking techniques for parametric timed automata, and present some case studies.

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

[2]  Rance Cleaveland,et al.  RTSL: a language for real-time schedulability analysis , 1993, 1993 Proceedings Real-Time Systems Symposium.

[3]  Michael González Harbour,et al.  Schedulability analysis for tasks with static and dynamic offsets , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[4]  Wang Yi,et al.  Timed Automata with Asynchronous Processes: Schedulability and Decidability , 2002, TACAS.

[5]  Pravin Varaiya,et al.  Suspension Automata: A Decidable Class of Hybrid Automata , 1994, CAV.

[6]  Alberto Griggio,et al.  Efficient Interpolant Generation in Satisfiability Modulo Theories , 2008, TACAS.

[7]  Fausto Giunchiglia,et al.  NUSMV: A New Symbolic Model Verifier , 1999, CAV.

[8]  Wang Yi,et al.  Timed automata as task models for event-driven systems , 1999, Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306).

[9]  Sang Hyuk Son,et al.  Performance specifications and metrics for adaptive real-time systems , 2000, Proceedings 21st IEEE Real-Time Systems Symposium.

[10]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[11]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[12]  Mary Sheeran,et al.  Checking Safety Properties Using Induction and a SAT-Solver , 2000, FMCAD.

[13]  Mathai Joseph,et al.  Finding Response Times in a Real-Time System , 1986, Comput. J..

[14]  Milind Dawande,et al.  Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming , 2000, Oper. Res..

[15]  Wang Yi,et al.  TIMES - A Tool for Modelling and Implementation of Embedded Systems , 2002, TACAS.

[16]  Giorgio C. Buttazzo,et al.  Schedulability analysis of periodic fixed priority systems , 2004, IEEE Transactions on Computers.

[17]  Wang Yi,et al.  Schedulability Analysis Using Two Clocks , 2003, TACAS.

[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]  Thomas A. Henzinger,et al.  Parametric real-time reasoning , 1993, STOC.

[20]  François Laroussinie,et al.  Model-Checking for Hybrid Systems by Quotienting and Constraints Solving , 2000, CAV.

[21]  Marco Roveri,et al.  Computing Predicate Abstractions by Integrating BDDs and SMT Solvers , 2007, Formal Methods in Computer Aided Design (FMCAD'07).

[22]  James C. Corbett,et al.  Modeling and analysis of real-time Ada tasking programs , 1994, 1994 Proceedings Real-Time Systems Symposium.

[23]  J. Leung,et al.  A Note on Preemptive Scheduling of Periodic, Real-Time Tasks , 1980, Inf. Process. Lett..

[24]  Roberto Bruttomesso,et al.  The MathSAT 4 SMT Solver ( Tool Paper ) , 2008 .

[25]  Gilles Audemard,et al.  Bounded Model Checking for Timed Systems , 2002, FORTE.

[26]  F. Vaandrager,et al.  Linear Parametric Model Checking of Timed Automata , 2001 .

[27]  Dezhuang Zhang,et al.  Fast on-the-fly parametric real-time model checking , 2005, 26th IEEE International Real-Time Systems Symposium (RTSS'05).

[28]  Giorgio Buttazzo,et al.  Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications , 1997 .