Scenario-based verification of uncertain MDPs
From MaRDI portal
Recommendations
- Polynomial-time verification of PCTL properties of MDPs with convex uncertainties
- Verification of Markov decision processes using learning algorithms
- Distributionally robust Markov decision processes
- Probabilistic Verification of Uncertain Systems Using Bounded-Parameter Markov Decision Processes
- Robust Markov Decision Processes
Cites work
- A General Scenario Theory for Nonconvex Optimization and Decision Making
- A logic for reasoning about time and reliability
- A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality
- Bayesian statistical parameter synthesis for linear temporal properties of stochastic models
- Bounded-parameter Markov decision processes
- Chance-constrained programming
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Decision Problems for Interval Markov Chains
- Fast randomized consensus using shared memory
- scientific article; zbMATH DE number 1670788 (Why is no real title available?)
- scientific article; zbMATH DE number 2087806 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 783783 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- Improving time bounded reachability computations in interactive Markov chains
- Parameter synthesis for Markov models: faster than ever
- Parameter-Independent Strategies for pMDPs via POMDPs
- Polynomial-time verification of PCTL properties of MDPs with convex uncertainties
- Programming Languages and Systems
- Reinforcement learning. An introduction
- Robust Control of Markov Decision Processes with Uncertain Transition Matrices
- Robust Markov Decision Processes
- Sampling Based Approaches for Minimizing Regret in Uncertain Markov Decision Processes (MDPs)
- Sequential convex programming for the efficient verification of parametric MDPs
- The complexity of reachability in parametric Markov decision processes
- The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
- The Scenario Approach to Robust Control Design
- Theoretical Aspects of Computing - ICTAC 2004
- Theory and applications of robust optimization
- Uncertain convex programs: randomized solutions and confidence levels
- What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives
Cited in
(13)- Reward-bounded reachability probability for uncertain weighted MDPs
- Polynomial-time verification of PCTL properties of MDPs with convex uncertainties
- Sequential convex programming for the efficient verification of parametric MDPs
- Verification of Markov decision processes using learning algorithms
- Probabilistic Verification of Uncertain Systems Using Bounded-Parameter Markov Decision Processes
- Sampling-Based Verification of CTMCs with Uncertain Rates
- Verification of Indefinite-Horizon POMDPs
- Automatically finding the right probabilities in Bayesian networks
- Bayes-Adaptive Planning for Data-Efficient Verification of Uncertain Markov Decision Processes
- Efficient sensitivity analysis for parametric robust Markov chains
- Parameter synthesis for Markov models: covering the parameter space
- Data-driven abstractions for control systems via random exploration
- Model checking finite-horizon Markov chains with probabilistic inference
This page was built for publication: Scenario-based verification of uncertain MDPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5039513)
