The following pages link to SIGREF (Q13603):
Displaying 13 items.
- Polynomial time decision algorithms for probabilistic automata (Q498403) (← links)
- Computing maximal weak and other bisimulations (Q510897) (← links)
- Game-theoretic simulation checking tool (Q764005) (← links)
- Next-preserving branching bisimulation (Q2355689) (← links)
- SMT-Based Bisimulation Minimisation of Markov Models (Q2926637) (← links)
- On Abstraction of Probabilistic Systems (Q2937733) (← links)
- The How and Why of Interactive Markov Chains (Q3066128) (← links)
- Model Based Importance Analysis for Minimal Cut Sets (Q3540081) (← links)
- Compositional Abstraction for Stochastic Systems (Q3648832) (← links)
- Three-Valued Abstraction for Continuous-Time Markov Chains (Q5429326) (← links)
- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking (Q5758103) (← links)
- A Symbolic Algorithm for Optimal Markov Chain Lumping (Q5758108) (← links)
- Cost Preserving Bisimulations for Probabilistic Automata (Q5892065) (← links)
