On the Complexity of Reachability in Parametric Markov Decision Processes
From MaRDI portal
Publication:5875375
DOI10.4230/LIPICS.CONCUR.2019.14OpenAlexW3099141145MaRDI QIDQ5875375FDOQ5875375
Authors: Tobias Winkler, Sebastian Junges, G. A. Pérez, Joost-Pieter Katoen 
Publication date: 3 February 2023
Full work available at URL: https://arxiv.org/abs/1904.01503
Recommendations
Cites Work
- Stochastic Games
- Title not available (Why is that?)
- The Complexity of Decentralized Control of Markov Decision Processes
- Representing polynomials by positive linear functions on compact convex polyhedra
- Model repair for probabilistic systems
- A survey of stochastic \(\omega \)-regular games
- Title not available (Why is that?)
- Theoretical Aspects of Computing - ICTAC 2004
- Algorithms in real algebraic geometry
- Robust Control of Markov Decision Processes with Uncertain Transition Matrices
- Concurrent reachability games
- Existence of p-Equilibrium and Optimal Stationary Strategies in Stochastic Games
- Realizability of graphs and linkages
- Discounted and positive stochastic games
- Continuity of the value of competitive Markov decision processes
- Robust Markov Decision Processes
- Bounded-parameter Markov decision processes
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- Tools and Algorithms for the Construction and Analysis of Systems
- Qualitative reachability for open interval Markov chains
- Reachability in augmented interval Markov chains
- Fixed points, Nash equilibria, and the existential theory of the reals
- Efficient solutions to factored MDPs with imprecise transition probabilities
- Reachability analysis of uncertain systems using bounded-parameter Markov decision processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parameter synthesis for Markov models: faster than ever
- Bayesian statistical parameter synthesis for linear temporal properties of stochastic models
- Precise parameter synthesis for stochastic biochemical systems
- Robustness of structurally equivalent concurrent parity games
- Synthesis in pMDPs: a tale of 1001 parameters
- Parametric probabilistic transition systems for system design and analysis
- Title not available (Why is that?)
- Polynomial-time verification of PCTL properties of MDPs with convex uncertainties
- On the complexity of model checking interval-valued discrete time Markov chains
- Accelerated model checking of parametric Markov chains
- On the Computational Complexity of Stochastic Controller Optimization in POMDPs
- Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
- Perturbation analysis in verification of discrete-time Markov chains
- Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms
Cited In (8)
- Parameter synthesis for Markov models: covering the parameter space
- The complexity of reachability in parametric Markov decision processes
- Robust almost-sure reachability in multi-environment MDPs
- Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
- On the \(p\)-reinforcement and the complexity
- Nested Reachability Approximation for Discrete-Time Markov Chains with Univariate Parameters
- Reachability and safety objectives in Markov decision processes on long but finite horizons
- Reachability analysis of uncertain systems using bounded-parameter Markov decision processes
Uses Software
This page was built for publication: On the Complexity of Reachability in Parametric Markov Decision Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875375)
