2026-08-16T20:48:12Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:8987 2024-03-06T10:43:05Z ddc:004 open_access

Verifying Weakly-Hard Real-Time Properties of Traffic Streams in Switched Networks Ahrendts, Leonie Quinton, Sophie Boroske, Thomas Ernst, Rolf embedded and cyber-physical systems weakly-hard real-time systems and networks timing analysis 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 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Leonie Ahrendts and Sophie Quinton and Thomas Boroske and Rolf Ernst 2018 Is Part Of LIPIcs, Volume 106, 30th Euromicro Conference on Real-Time Systems (ECRTS 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ECRTS.2018.15 urn:nbn:de:0030-drops-89879 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2018.15 eng https://creativecommons.org/licenses/by/3.0/legalcode