guest ::
000780394 001__ 780394 000780394 005__ 20240311104415.0 000780394 0247_ $$2ISBN$$a978-3-95977-121-4 000780394 0247_ $$2ISSN$$a1868-8969 000780394 0247_ $$2SCOPUS$$aSCOPUS:2-s2.0-85071632230 000780394 0247_ $$2datacite_doi$$a10.18154/RWTH-2020-00609 000780394 0247_ $$2doi$$a10.4230/LIPICS.CONCUR.2019.14 000780394 037__ $$aRWTH-2020-00609 000780394 041__ $$aEnglish 000780394 1001_ $$0P:(DE-82)IDM03625$$aWinkler, Tobias$$b0$$urwth 000780394 1112_ $$a30. International Conference on Concurrency Theory$$cAmsterdam$$d2019-08-27 - 2019-08-30$$gCONCUR$$wNetherlands 000780394 245__ $$aOn the Complexity of Reachability in Parametric Markov Decision Processes$$honline 000780394 260__ $$aSaarbrücken/Wadern, Germany$$bSchloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, August$$c2019 000780394 29510 $$a30th International Conference on Concurrency Theory : CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands / edited by Wan Fokkink, Rob van Glabbeek 000780394 3367_ $$033$$2EndNote$$aConference Paper 000780394 3367_ $$0PUB:(DE-HGF)7$$2PUB:(DE-HGF)$$aContribution to a book 000780394 3367_ $$0PUB:(DE-HGF)8$$2PUB:(DE-HGF)$$aContribution to a conference proceedings$$bcontrib$$mcontrib 000780394 3367_ $$2BibTeX$$aINPROCEEDINGS 000780394 3367_ $$2DRIVER$$aconferenceObject 000780394 3367_ $$2DataCite$$aOutput Types/Conference Paper 000780394 3367_ $$2ORCID$$aCONFERENCE_PAPER 000780394 4900_ $$aLeibniz international proceedings in informatics : LIPIcs$$v140 000780394 588__ $$aDataset connected to DataCite 000780394 591__ $$aBelgium 000780394 591__ $$aGermany 000780394 7001_ $$0P:(DE-82)IDM01624$$aJunges, Sebastian$$b1$$eCorresponding author$$urwth 000780394 7001_ $$aPérez, Guillermo A.$$b2 000780394 7001_ $$0P:(DE-82)IDM00048$$aKatoen, Joost-Pieter$$b3$$urwth 000780394 8564_ $$uhttps://publications.rwth-aachen.de/record/780394/files/780394.pdf$$yOpenAccess 000780394 8564_ $$uhttps://publications.rwth-aachen.de/record/780394/files/780394.gif?subformat=icon$$xicon$$yOpenAccess 000780394 8564_ $$uhttps://publications.rwth-aachen.de/record/780394/files/780394.jpg?subformat=icon-180$$xicon-180$$yOpenAccess 000780394 8564_ $$uhttps://publications.rwth-aachen.de/record/780394/files/780394.jpg?subformat=icon-700$$xicon-700$$yOpenAccess 000780394 909CO $$ooai:publications.rwth-aachen.de:780394$$pVDB$$pdnbdelivery$$pdriver$$popen_access$$popenaire 000780394 9101_ $$0I:(DE-588b)36225-6$$6P:(DE-82)IDM03625$$aRWTH Aachen$$b0$$kRWTH 000780394 9101_ $$0I:(DE-588b)36225-6$$6P:(DE-82)IDM01624$$aRWTH Aachen$$b1$$kRWTH 000780394 9101_ $$0I:(DE-588b)36225-6$$6P:(DE-82)IDM00048$$aRWTH Aachen$$b3$$kRWTH 000780394 9141_ $$y2019 000780394 9151_ $$0StatID:(DE-HGF)0031$$2StatID$$aPeer reviewed article$$x0 000780394 915__ $$0LIC:(DE-HGF)CCBY3$$2HGFVOC$$aCreative Commons Attribution CC BY 3.0 000780394 915__ $$0StatID:(DE-HGF)0510$$2StatID$$aOpenAccess 000780394 9201_ $$0I:(DE-82)121310_20140620$$k121310$$lLehrstuhl für Informatik 2 (Softwaremodellierung und Verifikation)$$x0 000780394 9201_ $$0I:(DE-82)120000_20140620$$k120000$$lFachgruppe Informatik$$x1 000780394 9201_ $$0I:(DE-82)080060_20170720$$k080060$$lGraduiertenkolleg UnRAVeL$$x2 000780394 961__ $$c2020-01-14T14:11:53.303260$$x2020-01-14T14:11:53.303260$$z2020-01-14 000780394 9801_ $$aFullTexts 000780394 980__ $$aI:(DE-82)080060_20170720 000780394 980__ $$aI:(DE-82)120000_20140620 000780394 980__ $$aI:(DE-82)121310_20140620 000780394 980__ $$aUNRESTRICTED 000780394 980__ $$aVDB 000780394 980__ $$acontb 000780394 980__ $$acontrib