Abstraction-Refinement for Hierarchical Probabilistic Models

DOI10.1007/978-3-031-13185-1_6MaRDI QIDQ6487314zbMATH OpenFDO

Authors Sebastian Junges, Matthijs T. J. Spaan

Publication date 7 December 2022

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-13185-1_6

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Specification and verification (program logics, model checking, etc.) (68Q60) Markov and semi-Markov decision processes (90C40)

Recommendations

• Abstraction refinement guided by a learnt probabilistic model
• Abstraction Refinement for Probabilistic Software
• Full abstraction for probabilistic PCF
• Variable probabilistic abstraction refinement
• scientific article; zbMATH DE number 1568689
• Abstraction of Probabilistic Systems

Cites work

• A game-based abstraction-refinement framework for Markov decision processes
• Assume-guarantee verification for probabilistic systems
• Bounded model checking for probabilistic programs
• Ensuring the reliability of your model checker: interval iteration for Markov decision processes
• Finding provably optimal Markov chains
• Fine-tuning the odds in Bayesian networks
• scientific article; zbMATH DE number 5685899 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Inductive synthesis for probabilistic programs reaches new horizons
• Learning-based compositional verification for synchronous probabilistic systems
• Model repair for probabilistic systems
• Multi-cost bounded tradeoff analysis in MDP
• Of cores: a partial-exploration framework for Markov decision processes
• Parameter synthesis for Markov models: faster than ever
• Polynomial-time verification of PCTL properties of MDPs with convex uncertainties
• Probabilistic CEGAR
• Probabilistic Contracts for Component-Based Design
• Verification of Markov decision processes using learning algorithms

Cited in

(8)

• A Multi-level Refinement Approach for Structural Synthesis of Optimal Probabilistic Models
• Parameter synthesis in Markov models: a gentle survey
• Compositional probabilistic model checking with string diagrams of MDPs
• Efficient sensitivity analysis for parametric robust Markov chains
• Parameter synthesis for Markov models: covering the parameter space
• Computing expected visiting times and stationary distributions in Markov chains: fast and accurate
• Compositional verification of almost-sure Büchi objectives in MDPs
• Compositional reasoning for parametric probabilistic automata

This page was built for publication: Abstraction-Refinement for Hierarchical Probabilistic Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487314)