2026-07-20T07:29:07Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:15544 2024-03-06T10:55:33Z ddc:004 open_access

Resilience of Timed Systems Akshay, S. Genest, Blaise Hélouët, Loïc Krishna, S. Roychowdhury, Sparsa Timed automata Fault tolerance Integer-resets Resilience This paper addresses reliability of timed systems in the setting of resilience, that considers the behaviors of a system when unspecified timing errors such as missed deadlines occur. Given a fault model that allows transitions to fire later than allowed by their guard, a system is universally resilient (or self-resilient) if after a fault, it always returns to a timed behavior of the non-faulty system. It is existentially resilient if after a fault, there exists a way to return to a timed behavior of the non-faulty system, that is, if there exists a controller which can guide the system back to a normal behavior. We show that universal resilience of timed automata is undecidable, while existential resilience is decidable, in EXPSPACE. To obtain better complexity bounds and decidability of universal resilience, we consider untimed resilience, as well as subclasses of timed automata. Schloss Dagstuhl – Leibniz-Zentrum für Informatik S. Akshay and Blaise Genest and Loïc Hélouët and S. Krishna and Sparsa Roychowdhury 2021 Is Part Of LIPIcs, Volume 213, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2021.33 urn:nbn:de:0030-drops-155442 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2021.33 eng https://creativecommons.org/licenses/by/4.0/legalcode