Pages that link to "Item:Q5758103"
From MaRDI portal
The following pages link to Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking (Q5758103):
Displaying 7 items.
- Deciding probabilistic automata weak bisimulation: theory and practice (Q282105) (← links)
- Three-valued abstraction for probabilistic systems (Q444484) (← links)
- Branching bisimulation congruence for probabilistic systems (Q764289) (← links)
- Performability assessment by model checking of Markov reward models (Q968359) (← links)
- Parity game reductions (Q1656552) (← links)
- Equivalence checking 40 years after: a review of bisimulation tools (Q6163887) (← links)
- Automatically finding the right probabilities in Bayesian networks (Q6488813) (← links)
