Abstract-Real-time systems with functional dependencies between tasks often require end-to-end (as opposed to task-level) guarantees. For many of these systems, it is even possible to accept the possibility of longer end-to-end delays if one can bound their frequency. Such systems are called weakly-hard. In this paper we provide end-to-end deadline miss models for systems with task chains using Typical Worst-Case Analysis (TWCA). This bounds the number of potential deadline misses in a given sequence of activations of a task chain. To achieve this we exploit task chain properties which arise from the priority assignment of tasks in static-priority preemptive systems. This work is motivated by and validated on a realistic case study inspired by industrial practice and derived synthetic test cases.
In Reference REF , the system model was extended to bound deadline-misses in WHRT systems with task dependencies.
Bounding deadline misses in weakly-hard real-time systems with task dependencies
Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017
Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017
Computer Science