Efficient Timeout Synthesis in Fixed-Delay CTMC Using Policy Iteration
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F16%3A00088476" target="_blank" >RIV/00216224:14330/16:00088476 - isvavai.cz</a>
Result on the web
<a href="http://ieeexplore.ieee.org/document/7774605/" target="_blank" >http://ieeexplore.ieee.org/document/7774605/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/MASCOTS.2016.34" target="_blank" >10.1109/MASCOTS.2016.34</a>
Alternative languages
Result language
angličtina
Original language name
Efficient Timeout Synthesis in Fixed-Delay CTMC Using Policy Iteration
Original language description
We consider the fixed-delay synthesis problem for continuous-time Markov chains extended with fixed-delay transitions (fdCTMC). The goal is to synthesize concrete values of the fixed-delays (timeouts) that minimize the expected total cost incurred before reaching a given set of target states. The same problem has been considered and solved in previous works by computing an optimal policy in a certain discrete-time Markov decision process (MDP) with a huge number of actions that correspond to suitably discretized values of the timeouts. In this paper, we design a symbolic fixed-delay synthesis algorithm which avoids the explicit construction of large action spaces. Instead, the algorithm computes a small sets of "promising" candidate actions on demand. The candidate actions are selected by minimizing a certain objective function by computing its symbolic derivative and extracting a univariate polynomial whose roots are precisely the points where the derivative takes zero value.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA15-17564S" target="_blank" >GA15-17564S: Game Theory in Formal Analysis and Verification of Computer Systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
ISBN
9781509034314
ISSN
2375-0227
e-ISSN
—
Number of pages
6
Pages from-to
367-372
Publisher name
IEEE Computer Society
Place of publication
London
Event location
London
Event date
Jan 1, 2016
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—