swMATH859MaRDI QIDQ13603FDOQ13603
Author name not available (Why is that?)
Official website: http://ira.informatik.uni-freiburg.de/software/sigref/
Cited In (22)
- The how and why of interactive Markov chains
- Cost preserving bisimulations for probabilistic automata
- Three-Valued Abstraction for Continuous-Time Markov Chains
- On Abstraction of Probabilistic Systems
- Compositional abstraction for stochastic systems
- Polynomial time decision algorithms for probabilistic automata
- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
- A Symbolic Algorithm for Optimal Markov Chain Lumping
- SMT-based bisimulation minimisation of Markov models
- CEGAR
- Exp.Open
- TVT
- PEPA
- Concurrency Workbench
- Model Based Importance Analysis for Minimal Cut Sets
- Mec 5
- VERSA
- PyCUDD
- mCRL
- Game-theoretic simulation checking tool
- Computing maximal weak and other bisimulations
- Next-preserving branching bisimulation
This page was built for software: SIGREF
