Abstraction-Refinement for Hierarchical Probabilistic Models
From MaRDI portal
Publication:6487314
DOI10.1007/978-3-031-13185-1_6zbMath1514.68029MaRDI QIDQ6487314
Sebastian Junges, Matthijs T. J. Spaan
Publication date: 7 December 2022
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Markov and semi-Markov decision processes (90C40) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A game-based abstraction-refinement framework for Markov decision processes
- Parameter synthesis for Markov models: faster than ever
- Bounded model checking for probabilistic programs
- Finding provably optimal Markov chains
- Inductive synthesis for probabilistic programs reaches new horizons
- Fine-tuning the odds in Bayesian networks
- Ensuring the reliability of your model checker: interval iteration for Markov decision processes
- Multi-cost bounded tradeoff analysis in MDP
- Polynomial-Time Verification of PCTL Properties of MDPs with Convex Uncertainties
- Model Repair for Probabilistic Systems
- Learning-Based Compositional Verification for Synchronous Probabilistic Systems
- Verification of Markov Decision Processes Using Learning Algorithms
- Probabilistic CEGAR
- Assume-Guarantee Verification for Probabilistic Systems
- Probabilistic Contracts for Component-Based Design
This page was built for publication: Abstraction-Refinement for Hierarchical Probabilistic Models
