Compositional bisimulation minimization for interval Markov decision processes
From MaRDI portal
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Recommendations
- Probabilistic bisimulations for PCTL model checking of interval MDPs
- Exploiting robust optimization for interval probabilistic bisimulation
- Polynomial-time alternating probabilistic bisimulation for interval MDPs
- Polynomial-time verification of PCTL properties of MDPs with convex uncertainties
- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
Cited in
(8)- Exploiting robust optimization for interval probabilistic bisimulation
- Polynomial-time verification of PCTL properties of MDPs with convex uncertainties
- SMT-based bisimulation minimisation of Markov models
- Probabilistic bisimulations for PCTL model checking of interval MDPs
- Polynomial-time alternating probabilistic bisimulation for interval MDPs
- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
- Robust Control for Dynamical Systems with Non-Gaussian Noise via Formal Abstractions
- Equivalence checking 40 years after: a review of bisimulation tools
This page was built for publication: Compositional bisimulation minimization for interval Markov decision processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2798714)