A game-based abstraction-refinement framework for Markov decision processes
From MaRDI portal
Publication:600979
Recommendations
- Verification and refutation of probabilistic specifications via games
- Game-Based Probabilistic Predicate Abstraction in PRISM
- A counterexample-guided abstraction-refinement framework for Markov decision processes
- Modal stochastic games. Abstraction-refinement of probabilistic automata
- Scientific article; zbMATH DE number 2090703
Cites work
- scientific article; zbMATH DE number 1670775 (Why is no real title available?)
- scientific article; zbMATH DE number 3543391 (Why is no real title available?)
- scientific article; zbMATH DE number 3638844 (Why is no real title available?)
- scientific article; zbMATH DE number 1361118 (Why is no real title available?)
- scientific article; zbMATH DE number 549853 (Why is no real title available?)
- scientific article; zbMATH DE number 1884411 (Why is no real title available?)
- A counterexample-guided abstraction-refinement framework for Markov decision processes
- Abstract interpretation of programs as Markov decision processes
- Abstraction Refinement for Probabilistic Software
- An Analysis of Stochastic Shortest Path Problems
- Approximating labelled Markov processes
- Best probabilistic transformers
- Bisimulation through probabilistic testing
- Concurrent reachability games
- Game-Based Probabilistic Predicate Abstraction in PRISM
- Magnifying-Lens Abstraction for Markov Decision Processes
- Model Checking Software
- Performance analysis of probabilistic timed automata using digital clocks
- Probabilistic CEGAR
- Probabilistic abstract interpretation of imperative programs using truncated normal distributions
- Probabilistic guarded commands mechanized in HOL
- Stochastic Games
- Stochastic games for verification of probabilistic timed automata
- The complexity of stochastic games
- Tools and Algorithms for the Construction and Analysis of Systems
- Validation of Stochastic Systems
- Validation of Stochastic Systems
Cited in
(36)- Abstraction-Refinement for Hierarchical Probabilistic Models
- Model checking probabilistic systems
- On Abstraction of Probabilistic Systems
- Verification of general Markov decision processes by approximate similarity relations and policy refinement
- Model checking finite-horizon Markov chains with probabilistic inference
- Solving Games Via Three-Valued Abstraction Refinement
- A linear process-algebraic format with data for probabilistic automata
- Probabilistic verification of Herman's self-stabilisation algorithm
- Modal stochastic games. Abstraction-refinement of probabilistic automata
- Collaborative models for autonomous systems controller synthesis
- Verification of general Markov decision processes by approximate similarity relations and policy refinement
- Parameter synthesis for probabilistic timed automata using stochastic game abstractions
- Out of control: reducing probabilistic models by control-state elimination
- Reachability in MDPs: refining convergence of value iteration
- Magnifying-Lens Abstraction for Markov Decision Processes
- Solving games via three-valued abstraction refinement
- Stochastic games for verification of probabilistic timed automata
- scientific article; zbMATH DE number 2090703 (Why is no real title available?)
- Parameter synthesis for probabilistic timed automata using stochastic game abstractions
- Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
- Automata-based controller synthesis for stochastic systems: a game framework via approximate probabilistic relations
- Comparison of algorithms for simple stochastic games
- Local abstraction refinement for probabilistic timed programs
- Verification of Markov decision processes using learning algorithms
- Comparison of algorithms for simple stochastic games
- Value iteration for simple stochastic games: stopping criterion and learning algorithm
- The complexity of synchronizing Markov decision processes
- Model checking for probabilistic timed automata
- Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops
- A counterexample-guided abstraction-refinement framework for Markov decision processes
- k-Inductive Barrier Certificates for Stochastic Systems
- Abstract model repair for probabilistic systems
- Compositional synthesis of control barrier certificates for networks of stochastic systems against \(\omega\)-regular specifications
- Probabilistic guarantees for safe deep reinforcement learning
- Interval iteration algorithm for MDPs and IMDPs
- Verification and refutation of probabilistic specifications via games
This page was built for publication: A game-based abstraction-refinement framework for Markov decision processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q600979)
