A Realistic Model of Real-Time Systems for Efficient Scheduling

Fotsing, Christian; Geniet, Annie; Vidal-Naquet, Guy

doi:10.1109/sew.2009.16

Cited by 5 publications

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several works on extending the classical task models have been done [22,1,45,10,33,43,15]. We would like to extend our task model by exploiting the radio channel access protocol's time division nature.…”

Section: Discussionmentioning

confidence: 99%

Applicability of real-time schedulability analysis on a software radio protocol

Singhoff

Rubini

et al. 2012

Proceedings of the 2012 ACM Conference on High Integrity Language Technology

View full text Add to dashboard Cite

In this paper, we present our experience on integrating timing constraint verification and analysis, by using the realtime scheduling theory, in an industrial context. The verification process has been integrated into a design flow at THALES Communications & Security. We focus our work on Software Radio Protocols (SRP). We have used ModelDriven Engineering technologies and the Cheddar schedulability analysis tool for our experiment. We show how we have modeled a complete SRP in UML MARTE, a profile for real-time embedded systems, before using model transformation to extract information for schedulability analysis with Cheddar.

show abstract

Section: Discussionmentioning

confidence: 99%

Applicability of real-time schedulability analysis on a software radio protocol

Singhoff

Rubini

et al. 2012

Proceedings of the 2012 ACM Conference on High Integrity Language Technology

View full text Add to dashboard Cite

show abstract

Integrating semantic properties within a Petri net based scheduling tool

Fotsing

Geniet

2012

2012 23rd IEEE International Symposium on Rapid System Prototyping (RSP)

Self Cite

View full text Add to dashboard Cite

We consider real-time applications with interacting periodic tasks which may contain conditional statements. When the behaviours of the tasks are linked to the context, they may be interdependent, and some theoretical configurations may actually be impossible. Our concern is to reduce the schedulability analysis to the only coherent behaviours. We thus propose a model-driven approach. We first model the application and the semantic constraints coming from the tests. Then we propose a Petri net based model, whose aim is to enumerate the possible behaviours, and which takes the structural, the temporal and the semantic constraints into account.

show abstract