Learning algorithms for verification of Markov decision processes
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 1361121 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 2080040 (Why is no real title available?)
- scientific article; zbMATH DE number 2163041 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- A Survey of Applications of Markov Decision Processes
- A game-based abstraction-refinement framework for Markov decision processes
- A new polynomial-time algorithm for linear programming
- A sparse sampling algorithm for near-optimal planning in large Markov decision processes
- A survey of statistical model checking
- A theory of the learnable
- Algorithms for reinforcement learning.
- Approximating values of generalized-reachability stochastic games
- Asymptotically efficient adaptive allocation rules
- Comparison of algorithms for simple stochastic games
- Compositional controller synthesis for stochastic games
- Compositional strategy synthesis for stochastic games with multiple objectives
- Computer Aided Verification
- Computer Aided Verification
- Continuous-time Markov decisions based on partial exploration
- Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling
- Depth-First Search and Linear Graph Algorithms
- Dynamic programming and optimal control. Vol. 1.
- Efficient strategy iteration for mean payoff in Markov decision processes
- Ensuring the reliability of your model checker: interval iteration for Markov decision processes
- Integrated formal methods. 10th international conference, IFM 2013, Turku, Finland, June 10--14, 2013. Proceedings
- Near-optimal reinforcement learning in polynomial time
- Of cores: a partial-exploration framework for Markov decision processes
- Optimistic and topological value iteration for simple stochastic games
- PAC Statistical Model Checking of Mean Payoff in Discrete- and Continuous-Time MDP
- PAC statistical model checking for Markov decision processes and stochastic games
- Partial order reduction for probabilistic branching time
- Reinforcement learning in finite MDPs: PAC analysis
- Robust Control for Dynamical Systems with Non-Gaussian Noise via Formal Abstractions
- Some Problems in the Theory of Dynamic Programming
- Sound value iteration
- Statistical model checking
- Statistical model checking using perfect simulation
- Stopping criteria for value iteration on stochastic games with quantitative objectives
- Value iteration for long-run average reward in Markov decision processes
- \({\mathcal Q}\)-learning
This page was built for publication: Learning algorithms for verification of Markov decision processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6987456)
