@InProceedings{winkler_et_al:LIPIcs.CONCUR.2019.14,
author = {Winkler, Tobias and Junges, Sebastian and P\'{e}rez, Guillermo A. and Katoen, Joost-Pieter},
title = {{On the Complexity of Reachability in Parametric Markov Decision Processes}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {14:1--14:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.14},
URN = {urn:nbn:de:0030-drops-109162},
doi = {10.4230/LIPIcs.CONCUR.2019.14},
annote = {Keywords: Parametric Markov decision processes, Formal verification, ETR, Complexity}
}