Determining a soft or firm real-time task's probabilistic worst-case response time is a central
goal when quantifying and bounding the probability of deadline misses, but current …

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 …

The policy used to implement a control algorithm in a real-time system can significantly affect
the quality of control. In this paper, we present a method to adapt the controller …

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 …

Control theory allows one to design controllers that are robust to external disturbances,
model simplification, and modelling inaccuracy. Researchers have investigated whether the …

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

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 …

Estimating the worst-case deadline failure probability (WCDFP) of a real-time task is
notoriously difficult, primarily because a task's execution time typically depends on prior …

Probabilistic approaches have gained attention over the past decade, providing a modeling
framework that enables less pessimistic analysis of real-time systems. Among the different …

Probabilistic timing and schedulability analysis of real-time systems is constrained by the
problem of often intractable exact computations. The intractability problem is present …