A game-based abstraction-refinement framework for Markov decision processes
From MaRDI portal
Publication:600979
DOI10.1007/S10703-010-0097-6zbMATH Open1233.90276OpenAlexW2052092737MaRDI QIDQ600979FDOQ600979
Authors: Sumit K. Garg 
Publication date: 3 November 2010
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:f7858593-ff60-4ffa-b066-e49fec7c5b1d
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
Stochastic programming (90C15) Markov and semi-Markov decision processes (90C40) Stochastic games, stochastic differential games (91A15)
Cites Work
- The complexity of stochastic games
- Title not available (Why is that?)
- Stochastic Games
- Approximating labelled Markov processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bisimulation through probabilistic testing
- Concurrent reachability games
- Title not available (Why is that?)
- An Analysis of Stochastic Shortest Path Problems
- Performance analysis of probabilistic timed automata using digital clocks
- Validation of Stochastic Systems
- Title not available (Why is that?)
- Validation of Stochastic Systems
- Model Checking Software
- Probabilistic CEGAR
- Stochastic games for verification of probabilistic timed automata
- A counterexample-guided abstraction-refinement framework for Markov decision processes
- Magnifying-Lens Abstraction for Markov Decision Processes
- Tools and Algorithms for the Construction and Analysis of Systems
- Title not available (Why is that?)
- Abstract interpretation of programs as Markov decision processes
- Probabilistic guarded commands mechanized in HOL
- Abstraction Refinement for Probabilistic Software
- Best probabilistic transformers
- Game-Based Probabilistic Predicate Abstraction in PRISM
- Probabilistic abstract interpretation of imperative programs using truncated normal distributions
Cited In (36)
- Automata-based controller synthesis for stochastic systems: a game framework via approximate probabilistic relations
- Comparison of algorithms for simple stochastic games
- Comparison of algorithms for simple stochastic games
- Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops
- Model checking finite-horizon Markov chains with probabilistic inference
- Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
- Probabilistic verification of Herman's self-stabilisation algorithm
- Probabilistic guarantees for safe deep reinforcement learning
- The complexity of synchronizing Markov decision processes
- On Abstraction of Probabilistic Systems
- Solving games via three-valued abstraction refinement
- Reachability in MDPs: refining convergence of value iteration
- Local abstraction refinement for probabilistic timed programs
- Stochastic games for verification of probabilistic timed automata
- Verification of Markov decision processes using learning algorithms
- Model checking probabilistic systems
- Parameter synthesis for probabilistic timed automata using stochastic game abstractions
- A counterexample-guided abstraction-refinement framework for Markov decision processes
- Magnifying-Lens Abstraction for Markov Decision Processes
- Interval iteration algorithm for MDPs and IMDPs
- Out of control: reducing probabilistic models by control-state elimination
- Solving Games Via Three-Valued Abstraction Refinement
- Abstraction-Refinement for Hierarchical Probabilistic Models
- Verification of general Markov decision processes by approximate similarity relations and policy refinement
- Verification and refutation of probabilistic specifications via games
- A linear process-algebraic format with data for probabilistic automata
- Model checking for probabilistic timed automata
- Value iteration for simple stochastic games: stopping criterion and learning algorithm
- Modal stochastic games. Abstraction-refinement of probabilistic automata
- Title not available (Why is that?)
- Verification of general Markov decision processes by approximate similarity relations and policy refinement
- Parameter synthesis for probabilistic timed automata using stochastic game abstractions
- Abstract model repair for probabilistic systems
- Collaborative models for autonomous systems controller synthesis
- k-Inductive Barrier Certificates for Stochastic Systems
- Compositional synthesis of control barrier certificates for networks of stochastic systems against \(\omega\)-regular specifications
Uses Software
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)
