SIGREF
From MaRDI portal
Cited in
(23)- MRMC
- CEGAR
- Exp.Open
- TVT
- PEPA
- Next-preserving branching bisimulation
- Concurrency Workbench
- SMT-based bisimulation minimisation of Markov models
- On Abstraction of Probabilistic Systems
- The how and why of interactive Markov chains
- Mec 5
- VERSA
- Model Based Importance Analysis for Minimal Cut Sets
- Compositional abstraction for stochastic systems
- PyCUDD
- mCRL
- Polynomial time decision algorithms for probabilistic automata
- Computing maximal weak and other bisimulations
- Three-Valued Abstraction for Continuous-Time Markov Chains
- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
- A Symbolic Algorithm for Optimal Markov Chain Lumping
- Cost preserving bisimulations for probabilistic automata
- Game-theoretic simulation checking tool
This page was built for software: SIGREF