|Art der Arbeit:|
|Status der Arbeit:||offen|
There exist efficient methods for computing upper bounds on the worst-case timing scenario for a given real-time system. However, results provided by such methods do not reflect the frequency of worst-case occurrences even though, in many practical cases, embedded system applications accept occasional deadline violations as long as their number can be bounded.
A weakly hard real-time system is a system in which the distribution of its met and missed deadlines during a window of time is precisely bounded.
Anmerkung: Die Betreuung und Seminarpräsentation erfolgt in Englisch