Exploiting robust optimization for interval probabilistic bisimulation
From MaRDI portal
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
- Probabilistic bisimulations for PCTL model checking of interval MDPs
- Compositional bisimulation minimization for interval Markov decision processes
- Polynomial-time alternating probabilistic bisimulation for interval MDPs
- Polynomial-time verification of PCTL properties of MDPs with convex uncertainties
- Robust PCTL model checking
Cited in
(7)- Lumpability for uncertain continuous-time Markov chains
- Compositional bisimulation minimization for interval Markov decision processes
- Polynomial-time alternating probabilistic bisimulation for interval MDPs
- Robust Control for Dynamical Systems with Non-Gaussian Noise via Formal Abstractions
- Probabilistic bisimulations for PCTL model checking of interval MDPs
- Polynomial-time verification of PCTL properties of MDPs with convex uncertainties
- Robust PCTL model checking
This page was built for publication: Exploiting robust optimization for interval probabilistic bisimulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1693117)