2026-07-21T23:35:10Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:18031 2024-03-06T11:01:16Z ddc:004 open_access

Towards Efficient Explainability of Schedulability Properties in Real-Time Systems Baruah, Sanjoy Ekberg, Pontus Recurrent Task Systems Uniprocessor and Multiprocessor Schedulability Verification Explanation Computational Complexity Approximation Schemes The notion of efficient explainability was recently introduced in the context of hard-real-time scheduling: a claim that a real-time system is schedulable (i.e., that it will always meet all deadlines during run-time) is defined to be efficiently explainable if there is a proof of such schedulability that can be verified by a polynomial-time algorithm. We further explore this notion by (i) classifying a variety of common schedulability analysis problems according to whether they are efficiently explainable or not; and (ii) developing strategies for dealing with those determined to not be efficiently schedulable, primarily by identifying practically meaningful sub-problems that are efficiently explainable. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Sanjoy Baruah and Pontus Ekberg 2023 Is Part Of LIPIcs, Volume 262, 35th Euromicro Conference on Real-Time Systems (ECRTS 2023) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ECRTS.2023.2 urn:nbn:de:0030-drops-180313 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2023.2 eng https://creativecommons.org/licenses/by/4.0/legalcode