Reachability analysis of probabilistic systems by successive refinements
From MaRDI portal
Recommendations
- Bounded Verification of Reachability of Probabilistic Hybrid Systems
- Efficient probabilistic model checking of systems with ranged probabilities
- Towards quantitative verification of probabilistic transition systems
- Computing minimum and maximum reachability times in probabilistic systems
- ProbReach: verified probabilistic delta-reachability for stochastic hybrid systems
- Probabilistic black-box reachability checking (extended version)
Cited in
(38)- On the use of MTBDDs for performability analysis and verification of stochastic systems.
- Abstract model repair for probabilistic systems
- Probabilistic black-box reachability checking (extended version)
- Algorithmic probabilistic game semantics. Playing games with automata
- Statistical verification of PCTL using antithetic and stratified samples
- Local abstraction refinement for probabilistic timed programs
- On finite-state approximants for probabilistic computation tree logic
- Probability estimates for reachability of linear systems defined over finite fields
- Least upper bounds for probability measures and their applications to abstractions
- Analyzing oscillatory behavior with formal methods
- On Abstraction of Probabilistic Systems
- Are parametric Markov chains monotonic?
- Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates
- Best probabilistic transformers
- Safety verification for probabilistic hybrid systems
- Minimal counterexamples for linear-time probabilistic verification
- Computing minimum and maximum reachability times in probabilistic systems
- Three-valued abstraction for probabilistic systems
- Verification of partial-information probabilistic systems using counterexample-guided refinements
- Symbolic computation of maximal probabilistic reachability
- scientific article; zbMATH DE number 2090703 (Why is no real title available?)
- Efficient probabilistic model checking of systems with ranged probabilities
- Farkas certificates and minimal witnesses for probabilistic reachability constraints
- Approximating probabilistic behaviors of biological systems using abstract interpretation
- Game-Based Probabilistic Predicate Abstraction in PRISM
- Magnifying-Lens Abstraction for Markov Decision Processes
- A game-based abstraction-refinement framework for Markov decision processes
- Bounded Verification of Reachability of Probabilistic Hybrid Systems
- Generating probabilistic safety guarantees for neural network controllers
- Finite Approximation of LMPs for Exact Verification of Reachability Properties
- On the use of model and logical embeddings for model checking of probabilistic systems
- Exploiting adjoints in property directed reachability analysis
- Probabilistic program verification via inductive synthesis of inductive invariants
- Parameter synthesis for Markov models: covering the parameter space
- CEGAR for compositional analysis of qualitative properties in Markov decision processes
- A linear process-algebraic format with data for probabilistic automata
- Probabilistic model checking of biological systems with uncertain kinetic rates
- Latticed \(k\)-induction with an application to probabilistic programs
This page was built for publication: Reachability analysis of probabilistic systems by successive refinements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4798031)
