On the Complexity of Reachability in Parametric Markov Decision Processes
From MaRDI portal
Publication:5875375
Recommendations
Cites work
- scientific article; zbMATH DE number 1638655 (Why is no real title available?)
- scientific article; zbMATH DE number 4154239 (Why is no real title available?)
- scientific article; zbMATH DE number 783783 (Why is no real title available?)
- scientific article; zbMATH DE number 7204389 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- A survey of stochastic -regular games
- Accelerated model checking of parametric Markov chains
- Algorithms in real algebraic geometry
- Bayesian statistical parameter synthesis for linear temporal properties of stochastic models
- Bounded-parameter Markov decision processes
- Concurrent reachability games
- Continuity of the value of competitive Markov decision processes
- Discounted and positive stochastic games
- Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms
- Efficient solutions to factored MDPs with imprecise transition probabilities
- Existence of p-Equilibrium and Optimal Stationary Strategies in Stochastic Games
- Fixed points, Nash equilibria, and the existential theory of the reals
- Model repair for probabilistic systems
- On the Computational Complexity of Stochastic Controller Optimization in POMDPs
- On the complexity of model checking interval-valued discrete time Markov chains
- 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
- Parameter synthesis for Markov models: faster than ever
- Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
- Parametric probabilistic transition systems for system design and analysis
- Perturbation analysis in verification of discrete-time Markov chains
- Polynomial-time verification of PCTL properties of MDPs with convex uncertainties
- Precise parameter synthesis for stochastic biochemical systems
- Qualitative reachability for open interval Markov chains
- Reachability analysis of uncertain systems using bounded-parameter Markov decision processes
- Reachability in augmented interval Markov chains
- Realizability of graphs and linkages
- Representing polynomials by positive linear functions on compact convex polyhedra
- Robust Control of Markov Decision Processes with Uncertain Transition Matrices
- Robust Markov Decision Processes
- Robustness of structurally equivalent concurrent parity games
- Stochastic Games
- Synthesis in pMDPs: a tale of 1001 parameters
- The Complexity of Decentralized Control of Markov Decision Processes
- Theoretical Aspects of Computing - ICTAC 2004
- Tools and Algorithms for the Construction and Analysis of Systems
Cited in
(8)- The complexity of reachability in parametric Markov decision processes
- Parameter synthesis for Markov models: covering the parameter space
- 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
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)
