On the Complexity of Reachability in Parametric Markov Decision Processes (Q5875375)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the Complexity of Reachability in Parametric Markov Decision Processes |
scientific article; zbMATH DE number 7649922
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Complexity of Reachability in Parametric Markov Decision Processes |
scientific article; zbMATH DE number 7649922 |
Statements
3 February 2023
0 references
parametric Markov decision processes
0 references
formal verification
0 references
ETR
0 references
complexity
0 references
On the Complexity of Reachability in Parametric Markov Decision Processes (English)
0 references
0 references
0 references
0.9541865587234496
0 references
0.7964842915534973
0 references
0.7952874898910522
0 references
Q1786613 (Deleted Item)
0.7923544049263
0 references
