Verifying Weakly-Hard Real-Time Properties of Traffic Streams in Switched Networks

Leonie Ahrendts, Sophie Quinton, Thomas Boroske, Rolf Ernst, Marc Herbstritt
2018 Euromicro Conference on Real-Time Systems  
In this paper, we introduce the first verification method which is able to provide weakly-hard real-time guarantees for tasks and task chains in systems with multiple resources under partitioned scheduling with fixed priorities. Existing weakly-hard real-time verification techniques are restricted today to systems with a single resource. A weakly-hard real-time guarantee specifies an upper bound on the maximum number m of deadline misses of a task in a sequence of k consecutive executions. Such
more » ... a guarantee is useful if a task can experience a bounded number of deadline misses without impacting the system mission. We present our verification method in the context of switched networks with traffic streams between nodes, and demonstrate its practical applicability in an automotive case study. ACM Subject Classification Computer systems organization → Embedded systems, Computer systems organization → Real-time systems, Software and its engineering → Formal software verification, Networks → Network performance analysis Keywords and phrases embedded and cyber-physical systems, weakly-hard real-time systems and networks, timing analysis
doi:10.4230/lipics.ecrts.2018.15 dblp:conf/ecrts/AhrendtsQBE18 fatcat:zwxbja44rjel7dfcopiksmbdri