Pages that link to "Item:Q498403"

The following pages link to Polynomial time decision algorithms for probabilistic automata (Q498403):

Displaying 9 items.

• Deciding probabilistic automata weak bisimulation: theory and practice (Q282105) (← links)
• Raiders of the lost equivalence: probabilistic branching bisimilarity (Q783681) (← links)
• Model independent approach to probabilistic models (Q831149) (← links)
• The quest for minimal quotients for probabilistic and Markov automata (Q1784955) (← links)
• On well-founded and recursive coalgebras (Q2200809) (← links)
• Verifying quantum communication protocols with ground bisimulation (Q2233434) (← links)
• An efficient algorithm to determine probabilistic bisimulation (Q2633253) (← links)
• (Q5089272) (← links)
• On divergence-sensitive weak probabilistic bisimilarity (Q6040671) (← links)