In soft real-time systems, tasks may occasionally miss their deadlines. This possibility has
triggered research on probabilistic timing analysis for the execution time of a single program …

Software in autonomous systems, owing to performance requirements, is deployed on
heterogeneous hardware comprising task specific accelerators, graphical processing units …

Weakly-hard models have been used to analyse real-time systems subject to patterns of
deadline hits and misses. However, the tools that are available in the literature have a set of …

In many applications of cyber-physical systems, a sequence of tasks is necessary to perform
a certain functionality. For example, from a sensor to an actuator, the first task reads the …

In the optimization of real-time systems, designers often face a challenging problem where
the schedulability conditions are non-convex, non-continuous, or lack an analytical form to …

Probabilistic timing guarantees enable a tradeoff between system safety and hardware costs
in embedded real-time systems. A key metric for assessing whether timing requirements can …

In many embedded systems, for instance, in the automotive, avionic, or robotics domain,
critical functionalities are implemented via chains of communicating recurrent tasks. To …

The recent revival in learning theory gives us improved capabilities for accurate predictions
and increased opportunities for performance enhancement. This work extends the research …

In this paper, we prove that a mean system utilization smaller than one is a necessary
condition for the feasibility of real-time systems. Such systems are defined as stable. Stable …

Modern embedded software includes complex functionalities and routines, often
implemented by splitting the code across different tasks. Such tasks communicate their …