Synthesis of Optimal Resilient Control Strategies

DOI10.1007/978-3-319-68167-2_27MaRDI QIDQ5096100zbMATH OpenOpenAlexFDO

Authors Clemens Dubslaff, Ľuboš Korenčiak, Vojtěch Řehák, Christel Baier, Antonin Kučera

Publication date 12 August 2022

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1707.03223

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Abstract: Repair mechanisms are important within resilient systems to maintain the system in an operational state after an error occurred. Usually, constraints on the repair mechanisms are imposed, e.g., concerning the time or resources required (such as energy consumption or other kinds of costs). For systems modeled by Markov decision processes (MDPs), we introduce the concept of resilient schedulers, which represent control strategies guaranteeing that these constraints are always met within some given probability. Assigning rewards to the operational states of the system, we then aim towards resilient schedulers which maximize the long-run average reward, i.e., the expected mean payoff. We present a pseudo-polynomial algorithm that decides whether a resilient scheduler exists and if so, yields an optimal resilient scheduler. We show also that already the decision problem asking whether there exists a resilient scheduler is PSPACE-hard.

Recommendations

Cited in

(8)

This page was built for publication: Synthesis of Optimal Resilient Control Strategies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096100)