Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{1365671,
author = {Korenčiak, Ľuboš and Kučera, Antonín and Řehák, Vojtěch},
address = {London},
booktitle = {2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems},
doi = {http://dx.doi.org/10.1109/MASCOTS.2016.34},
keywords = {Clocks: Protocols; Markov processes; Delays; Standards; Computational modeling},
howpublished = {tištěná verze "print"},
language = {eng},
location = {London},
isbn = {978-1-5090-3431-4},
pages = {367-372},
publisher = {IEEE Computer Society},
title = {Efficient Timeout Synthesis in Fixed-Delay CTMC Using Policy Iteration},
url = {http://ieeexplore.ieee.org/document/7774605/},
year = {2016}
}
TY - JOUR
ID - 1365671
AU - Korenčiak, Ľuboš - Kučera, Antonín - Řehák, Vojtěch
PY - 2016
TI - Efficient Timeout Synthesis in Fixed-Delay CTMC Using Policy Iteration
PB - IEEE Computer Society
CY - London
SN - 9781509034314
KW - Clocks: Protocols
KW - Markov processes
KW - Delays
KW - Standards
KW - Computational modeling
UR - http://ieeexplore.ieee.org/document/7774605/
L2 - http://ieeexplore.ieee.org/document/7774605/
N2 - 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. Since roots of high degree univariate polynomials can be isolated very efficiently using modern mathematical software, we achieve not only drastic memory savings but also speedup by three orders of magnitude compared to the previous methods.
ER -
KORENČIAK, Ľuboš, Antonín KUČERA a Vojtěch ŘEHÁK. Efficient Timeout Synthesis in Fixed-Delay CTMC Using Policy Iteration. Online. In \textit{2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems}. London: IEEE Computer Society, 2016. s.~367-372. ISBN~978-1-5090-3431-4. Dostupné z: https://dx.doi.org/10.1109/MASCOTS.2016.34. [citováno 2024-04-24]
|
