|
Title
|
|
|
|
On the complexity of reachability in parametric Markov decision processes
|
|
|
Author
|
|
|
|
|
|
|
Language
|
|
|
|
English
|
|
|
Source (journal)
|
|
|
|
LIPIcs : Leibniz International Proceedings in Informatics. - Place of publication unknown
|
|
|
Source (book)
|
|
|
|
30th International Conference on Concurrency Theory (CONCUR 2019) / Fokkink, Wan [edit.]; et al.
|
|
|
Publication
|
|
|
|
Wadern
:
Schloss Dagstuhl : Leibniz-Zentrum fuer Informatik
,
2019
|
|
|
ISSN
|
|
|
|
1868-8969
|
|
|
ISBN
|
|
|
|
978-3-95977-121-4
|
|
|
DOI
|
|
|
|
10.4230/LIPICS.CONCUR.2019.14
|
|
|
Volume/pages
|
|
|
|
140
, p. 1-17
|
|
|
Article Reference
|
|
|
|
14
|
|
|
Medium
|
|
|
|
E-only publicatie
|
|
|
Full text (Publisher's DOI)
|
|
|
|
|
|
|
Full text (open access)
|
|
|
|
|
|