Static timing analysis of cyber-physical systems with relaxed real-time constraints - Département Systèmes et Circuits Intégrés Numériques
Communication Dans Un Congrès Année : 2024

Static timing analysis of cyber-physical systems with relaxed real-time constraints

Résumé

Modern Cyber-Physical Systems (CPS) often involve dependent real-time processes bound to different timing constraints. These CPSs can be modeled using PolyGraph, a formalism that extends the Cyclo-Static Dataflow model with explicit real-time constraints. Unlike traditional real-time approaches where timing constraints are specified for every process, PolyGraph can offer greater flexibility by binding real-time constraints for only a subset of processes (e.g., processes associated with hardware components such as sensors and actuators), along with end-to-end latency specifications. In that case, processes without specified timing constraints only inherit ones from processes with explicit and specified timing constraints due to data dependencies. This paper aims to formalize a method to derive timing constraints for an entire PolyGraph model where only a subset of processes has explicit timing constraints in the model. We demonstrate how this approach eases scheduling constraints and enables early detection of missed deadlines through two examples from a vehicle ADAS and the Ingenuity Mars helicopter.

Domaines

Informatique
Fichier principal
Vignette du fichier
SEAA_2024 (5).pdf (478.15 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

cea-04719880 , version 1 (03-10-2024)

Identifiants

  • HAL Id : cea-04719880 , version 1

Citer

Guillaume Roumage, Cyril Faure, Selma Azaiez, Stephane Louise. Static timing analysis of cyber-physical systems with relaxed real-time constraints. SEAA 2024 : 50th Euromicro Conference Series on Software Engineering and Advanced Applications, Aug 2024, Paris sorbonne, France. pp.39-47. ⟨cea-04719880⟩
0 Consultations
0 Téléchargements

Partager

More