Detailed Information on Publication Record
2017
Synthesis of Optimal Resilient Control Strategies
BAIER, Christel, Clemens DUBSLAFF, Ľuboš KORENČIAK, Antonín KUČERA, Vojtěch ŘEHÁK et. al.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
Language
English
Type of outcome
Stať ve sborníku
Field of Study
10201 Computer sciences, information science, bioinformatics
Country of publisher
Switzerland
Confidentiality degree
není předmětem státního či obchodního tajemství
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
UT WoS
000723567800027
Keywords in English
controller synthesis; Markov decision processes; resilience
Tags
Tags
International impact, Reviewed
Změněno: 27/4/2018 11:00, RNDr. Pavel Šmerk, Ph.D.
Abstract
V originále
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 project |
| ||
MUNI/A/0992/2016, interní kód MU |
|