The following pages link to (Q4508289):
Displaying 5 items.
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- Polynomial time decision algorithms for probabilistic automata (Q498403) (← links)
- Probabilistic weak simulation is decidable in polynomial time (Q1029062) (← links)
- Branching bisimulation for probabilistic systems: characteristics and decidability (Q2491633) (← links)
- A space-efficient simulation algorithm on probabilistic automata (Q2629854) (← links)
