A Generic Task Model Using Timed Automata to Design and Analyze Real-Time Applications

Abstract : In this work, we propose an approach for automated analysis of real-time scheduling problems based on timed automata. Tasks are modeled using timed automata while schedulers correspond to feasible runs computed using model checking algorithms. Using this model, we present a method to prove on one hand the feasibility of a scheduling problem and to compute, on the other hand, an hybrid off-line/on-line scheduling policy. We expose how to use it to re-demonstrate well known results, to produce efficient schedule regarding of various properties such as minimal preemption number, and to address the problem of scheduling real-time task set composed by possibly self-suspending tasks which is known to be NP-hard.
Complete list of metadatas

Cited literature [28 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00598870
Contributor : Damien Masson <>
Submitted on : Wednesday, June 8, 2011 - 3:28:40 PM
Last modification on : Wednesday, July 4, 2018 - 4:37:57 PM
Long-term archiving on: Friday, November 9, 2012 - 2:51:02 PM

File

formats11.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00598870, version 1

Citation

Yasmina Abdeddaïm, Damien Masson. A Generic Task Model Using Timed Automata to Design and Analyze Real-Time Applications. 2011. ⟨hal-00598870⟩

Share

Metrics

Record views

561

Files downloads

197