BAIER, Christel, Clemens DUBSLAFF, Ľuboš KORENČIAK, Antonín KUČERA and Vojtěch ŘEHÁK. Synthesis of Optimal Resilient Control Strategies. In Deepak D'Souza, K. Narayan Kumar. Automated Technology for Verification and Analysis. Cham: Springer International Publishing, 2017, p. 417-434. ISBN 978-3-319-68166-5. Available from: https://dx.doi.org/10.1007/978-3-319-68167-2_27.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Synthesis of Optimal Resilient Control Strategies
Authors BAIER, Christel (276 Germany), Clemens DUBSLAFF (276 Germany), Ľuboš KORENČIAK (703 Slovakia, guarantor, belonging to the institution), Antonín KUČERA (203 Czech Republic, belonging to the institution) and Vojtěch ŘEHÁK (203 Czech Republic, belonging to the institution).
Edition Cham, Automated Technology for Verification and Analysis, p. 417-434, 18 pp. 2017.
Publisher Springer International Publishing
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Switzerland
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
Impact factor Impact factor: 0.402 in 2005
RIV identification code RIV/00216224:14330/17:00095082
Organization unit Faculty of Informatics
ISBN 978-3-319-68166-5
ISSN 0302-9743
Doi http://dx.doi.org/10.1007/978-3-319-68167-2_27
UT WoS 000723567800027
Keywords in English controller synthesis; Markov decision processes; resilience
Tags core_A, firank_A, formela-conference
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 27/4/2018 11:00.
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.
Links
GA15-17564S, research and development projectName: Teorie her jako prostředek pro formální analýzu a verifikaci počítačových systémů
Investor: Czech Science Foundation
MUNI/A/0992/2016, interní kód MUName: Zapojení studentů Fakulty informatiky do mezinárodní vědecké komunity (Acronym: SKOMU)
Investor: Masaryk University, Category A
PrintDisplayed: 27/4/2024 02:17