h1

h2

h3

h4

h5
h6
http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png

On the Complexity of Reachability in Parametric Markov Decision Processes

; ; ;

In
30th International Conference on Concurrency Theory : CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands / edited by Wan Fokkink, Rob van Glabbeek

Konferenz/Event:30. International Conference on Concurrency Theory , Amsterdam , Netherlands , CONCUR , 2019-08-27 - 2019-08-30

ImpressumSaarbrücken/Wadern, Germany : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, August

ISBN978-3-95977-121-4

ReiheLeibniz international proceedings in informatics : LIPIcs ; 140

Online
DOI: 10.18154/RWTH-2020-00609
DOI: 10.4230/LIPICS.CONCUR.2019.14

URL: http://publications.rwth-aachen.de/record/780394/files/780394.pdf

Einrichtungen

  1. Lehrstuhl für Informatik 2 (Softwaremodellierung und Verifikation) (121310)
  2. Fachgruppe Informatik (120000)
  3. Graduiertenkolleg UnRAVeL (080060)


OpenAccess:
Download fulltext PDF

Dokumenttyp
Contribution to a book/Contribution to a conference proceedings

Format
online

Sprache
English

Anmerkung
Peer reviewed article

Externe Identnummern
SCOPUS: SCOPUS:2-s2.0-85071632230

Interne Identnummern
RWTH-2020-00609
Datensatz-ID: 780394

Beteiligte Länder
Belgium, Germany

 GO

Creative Commons Attribution CC BY 3.0 ; OpenAccess
QR Code for this record

The record appears in these collections:
Document types > Events > Contributions to a conference proceedings
Document types > Books > Contributions to a book
Faculty of Mathematics, Computer Science and Natural Sciences (Fac.1) > Department of Computer Science
Publication server / Open Access
Central and Other Institutions
Public records
Publications database
120000
121310
080060
 Record created 2020-01-14, last modified 2024-03-11
Similar records


OpenAccess:
Download fulltext PDF
Rate this document:

Rate this document:
1
2
3
4
5
 
(Not yet reviewed)