Reduction and refinement strategies for probabilistic analysis
From MaRDI portal
Recommendations
- Reachability analysis of probabilistic systems by successive refinements
- A game-based abstraction-refinement framework for Markov decision processes
- Partial Order Reduction for Markov Decision Processes: A Survey
- Modal stochastic games. Abstraction-refinement of probabilistic automata
- High-level modelling and efficient analysis of randomized protocols.
Cited in
(18)- Inference procedures under uncertainty for the problem-reduction method
- A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
- Least upper bounds for probability measures and their applications to abstractions
- On Abstraction of Probabilistic Systems
- Probabilistic CEGAR
- Partial Order Reduction for Markov Decision Processes: A Survey
- Automatic Generation of Optimal Reductions of Distributions
- A Multi-level Refinement Approach for Structural Synthesis of Optimal Probabilistic Models
- Model checking linear-time properties of probabilistic systems
- Confluence reduction for Markov automata
- Of cores: a partial-exploration framework for Markov decision processes
- Approximating probabilistic behaviors of biological systems using abstract interpretation
- Magnifying-Lens Abstraction for Markov Decision Processes
- Of cores: a partial-exploration framework for Markov decision processes
- A game-based abstraction-refinement framework for Markov decision processes
- MeGARA: menu-based game abstraction and abstraction refinement of Markov automata
- CEGAR for compositional analysis of qualitative properties in Markov decision processes
This page was built for publication: Reduction and refinement strategies for probabilistic analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4813198)
