SMT-based bisimulation minimisation of Markov models
From MaRDI portal
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Specification and verification (program logics, model checking, etc.) (68Q60)
Recommendations
- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
- Finite-horizon bisimulation minimisation for probabilistic systems
- scientific article; zbMATH DE number 2080040
- Out of control: reducing probabilistic models by control-state elimination
- Compositional bisimulation minimization for interval Markov decision processes
Cited in
(12)- On Abstraction of Probabilistic Systems
- An efficient algorithm to determine probabilistic bisimulation
- Quantitative abstractions for collective adaptive systems
- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
- Equivalence checking 40 years after: a review of bisimulation tools
- Statistical model checking of stochastic component-based systems
- Language-based abstractions for dynamical systems
- Bisimulation minimization and symbolic model checking
- Out of control: reducing probabilistic models by control-state elimination
- Symbolic computation of differential equivalences
- On-the-Fly Branching Bisimulation Minimization for Compositional Analysis
- Finite-horizon bisimulation minimisation for probabilistic systems
This page was built for publication: SMT-based bisimulation minimisation of Markov models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2926637)
