BUTKOVA, Yuliya, Hassan HATEFI, Holger HERMANNS and Jan KRČÁL. Optimal Continuous Time Markov Decisions. In ATVA 2015. Shanghai, China: Springer. p. 166-182. ISBN 978-3-319-24952-0. doi:10.1007/978-3-319-24953-7_12. 2015.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Optimal Continuous Time Markov Decisions
Authors BUTKOVA, Yuliya (643 Russian Federation), Hassan HATEFI (364 Islamic Republic of Iran), Holger HERMANNS (276 Germany) and Jan KRČÁL (203 Czech Republic, guarantor, belonging to the institution).
Edition Shanghai, China, ATVA 2015, p. 166-182, 17 pp. 2015.
Publisher Springer
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Germany
Confidentiality degree is not subject to a state or trade secret
Publication form electronic version available online
Impact factor Impact factor: 0.402 in 2005
RIV identification code RIV/00216224:14330/15:00081290
Organization unit Faculty of Informatics
ISBN 978-3-319-24952-0
ISSN 0302-9743
Doi http://dx.doi.org/10.1007/978-3-319-24953-7_12
UT WoS 000374241600012
Keywords in English Continuous time Markov decision process; time bounded reachability; uniformisation; experimental evaluation
Tags core_A, firank_A, formela-conference
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 28/4/2016 15:33.
Abstract
In the context of Markov decision processes running in continuous time, one of the most intriguing challenges is the efficient approximation of finite horizon reachability objectives. A multitude of sophisticated model checking algorithms have been proposed for this. However, no proper benchmarking has been performed thus far. This paper presents a novel and yet simple solution: an algorithm originally developed for a restricted subclass of models and a subclass of schedulers can be twisted so as to become competitive with the more sophisticated algorithms in full generality. As the second main contribution, we perform a comparative evaluation of the core algorithmic concepts on an extensive set of benchmarks varying over all key parameters: model size, amount of non-determinism, time horizon, and precision.
Links
GBP202/12/G061, research and development projectName: Centrum excelence - Institut teoretické informatiky (CE-ITI) (Acronym: CE-ITI)
Investor: Czech Science Foundation
PrintDisplayed: 19/4/2024 13:21