Robust PCTL model checking
From MaRDI portal
Recommendations
- On the relationship between bisimulation and trace equivalence in an approximate probabilistic context
- Probabilistic model checking of labelled Markov processes via finite approximate bisimulations
- Exploiting robust optimization for interval probabilistic bisimulation
- Verification, Model Checking, and Abstract Interpretation
- scientific article; zbMATH DE number 1507207
Cited in
(12)- Partitioned PLTL model-checking for refined transition systems
- Exploiting robust optimization for interval probabilistic bisimulation
- A probabilistic calculus of cyber-physical systems
- Compositional abstraction-based synthesis of general MDPs via approximate probabilistic relations
- Automated verification and synthesis of stochastic hybrid systems: a survey
- Compositional abstraction-based synthesis for networks of stochastic switched systems
- Compositional abstraction of large-scale stochastic systems: a relaxed dissipativity approach
- On the relationship between bisimulation and trace equivalence in an approximate probabilistic context
- Verification of general Markov decision processes by approximate similarity relations and policy refinement
- Probabilistic model checking of labelled Markov processes via finite approximate bisimulations
- Sound approximate and asymptotic probabilistic bisimulations for PCTL
- A spectrum of approximate probabilistic bisimulations
This page was built for publication: Robust PCTL model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986774)