@inproceedings{89e9ea4be4ca466c846fea4a6d5dc1ee,
title = "Continuous-Time Markov Decisions Based on Partial Exploration",
abstract = "We provide a framework for speeding up algorithms for time-bounded reachability analysis of continuous-time Markov decision processes. The principle is to find a small, but almost equivalent subsystem of the original system and only analyse the subsystem. Candidates for the subsystem are identified through simulations and iteratively enlarged until runs are represented in the subsystem with high enough probability. The framework is thus dual to that of abstraction refinement. We instantiate the framework in several ways with several traditional algorithms and experimentally confirm orders-of-magnitude speed ups in many cases.",
author = "Pranav Ashok and Yuliya Butkova and Holger Hermanns and Jan K{\v r}et{\'i}nsk{\'y}",
note = "Publisher Copyright: {\textcopyright} 2018, Springer Nature Switzerland AG.; 16th International Symposium on Automated Technology for Verification and Analysis, ATVA 2018 ; Conference date: 07-10-2018 Through 10-10-2018",
year = "2018",
doi = "10.1007/978-3-030-01090-4\_19",
language = "English",
isbn = "9783030010898",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "317--334",
editor = "Chao Wang and Lahiri, \{Shuvendu K.\}",
booktitle = "Automated Technology for Verification and Analysis - 16th International Symposium, ATVA 2018, Proceedings",
}