Skip to Main content Skip to Navigation
Conference papers

A Brute-Force Schedulability Analysis for Formal Model under Logical Execution Time Assumption

Pierre-Emmanuel Hladik 1
1 LAAS-VERTICS - Équipe Verification de Systèmes Temporisés Critiques
LAAS - Laboratoire d'analyse et d'architecture des systèmes
Abstract : This article presents a schedulability analysis for real-time systems designed under the Logical Execution Time (LET) assumption. This assumption increases the predictability of real-time systems by separating time events from scheduling events. A toolchain based on the formal language Fiacre combined with the LET assumption is designed to organize a set of tools to model, verify, and generate code. In this context, an exact brute-force schedulability analysis based on a simulation is proposed. The tools and algorithms to manage the computation are described and a speedup is proposed. An experiment on a synthetic system shows the efficiency of this approach.
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download

https://hal.laas.fr/hal-01717293
Contributor : Pierre-Emmanuel Hladik <>
Submitted on : Monday, February 26, 2018 - 10:55:15 AM
Last modification on : Thursday, June 10, 2021 - 3:48:20 AM
Long-term archiving on: : Monday, May 28, 2018 - 6:00:37 PM

File

SAC2017.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01717293, version 1

Citation

Pierre-Emmanuel Hladik. A Brute-Force Schedulability Analysis for Formal Model under Logical Execution Time Assumption. The 33rd ACM/SIGAPP Symposium On Applied Computing (SAC), Apr 2018, Pau, France. 13p. ⟨hal-01717293⟩

Share

Metrics

Record views

178

Files downloads

319