This survey covers probabilistic timing analysis techniques for real-time systems. It reviews
and critiques the key results in the field from its origins in 2000 to the latest research …

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 …

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 timing and schedulability analysis of real-time systems is constrained by the
problem of often intractable exact computations. The intractability problem is present …

The demands on computing platforms in automotive systems are constantly increasing due
to the growing amount of software required by new vehicle functions. At the same time …

Schedulability analysis of real time systems under preemptive scheduling may often lead to
false negative results, deeming a schedulable taskset being unschedulable. This is the case …