A T-time Petri net extension for real time-task scheduling modeling

Abstract : In order to analyze whether timing requirements of a real-time application are met, we propose an extension of the T-time {Petri} net model which takes into account the scheduling of the software tasks distributed over a multi-processor hardware architecture. The paper is concerned with static priority pre-emptive based scheduling. This extension consists in mapping into the {Petri} net model the way the different schedulers of the system activate or suspend the tasks. This relies on the introduction of two new attributes for the places (allocation and priority). First we give the formal semantics of this extended model as a timed transition system (TTS). Then we propose a method for its analysis consisting in the computation of the state class graph. Thus the verification of timing properties can be conducted (possibly together with an observator) and comes to analyze the such obtained state class graph
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [22 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00489238
Contributor : Olivier Henri Roux <>
Submitted on : Friday, June 4, 2010 - 11:47:15 AM
Last modification on : Wednesday, December 19, 2018 - 3:02:04 PM
Document(s) archivé(s) le : Friday, September 17, 2010 - 1:08:17 PM

File

rd-jesa-2002.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00489238, version 1

Collections

Citation

Olivier Henri Roux, Anne-Marie Déplanche. A T-time Petri net extension for real time-task scheduling modeling. European Journal of Automation, Hermés Science, 2002, 36 (7), pp.973--987. ⟨hal-00489238⟩

Share

Metrics

Record views

525

Files downloads

515