Pages that link to "Item:Q1969600"
From MaRDI portal
The following pages link to Automated compositional Markov chain generation for a plain-old telephone system (Q1969600):
Displaying 7 items.
- Deciding probabilistic automata weak bisimulation: theory and practice (Q282105) (← links)
- Polynomial time decision algorithms for probabilistic automata (Q498403) (← links)
- On the use of MTBDDs for performability analysis and verification of stochastic systems. (Q1400289) (← links)
- The quest for minimal quotients for probabilistic and Markov automata (Q1784955) (← links)
- Probabilistic model checking of complex biological pathways (Q2474435) (← links)
- The How and Why of Interactive Markov Chains (Q3066128) (← links)
- YMCA (Q5262955) (← links)
