@InProceedings{grover_et_al:LIPIcs.CONCUR.2022.11,
author = {Grover, Kush and K\v{r}et{\'\i}nsk\'{y}, Jan and Meggendorfer, Tobias and Weininger, Maximilian},
title = {{Anytime Guarantees for Reachability in Uncountable Markov Decision Processes}},
booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)},
pages = {11:1--11:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-246-4},
ISSN = {1868-8969},
year = {2022},
volume = {243},
editor = {Klin, Bartek and Lasota, S{\l}awomir and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.11},
URN = {urn:nbn:de:0030-drops-170743},
doi = {10.4230/LIPIcs.CONCUR.2022.11},
annote = {Keywords: Uncountable system, Markov decision process, discrete-time Markov control process, probabilistic verification, anytime guarantee}
}