The following pages link to (Q4484499):
Displayed 11 items.
- Weak bisimulation for probabilistic timed automata (Q606996) (← links)
- Branching bisimulation congruence for probabilistic systems (Q764289) (← links)
- Axiomatizations for probabilistic finite-state behaviors (Q875517) (← links)
- Probabilistic weak simulation is decidable in polynomial time (Q1029062) (← links)
- Deciding probabilistic bisimilarity over infinite-state probabilistic systems (Q2482725) (← links)
- Branching bisimulation for probabilistic systems: characteristics and decidability (Q2491633) (← links)
- An Algorithm for Probabilistic Alternating Simulation (Q2891387) (← links)
- Abstract Probabilistic Automata (Q3075492) (← links)
- Bisimulations Meet PCTL Equivalences for Probabilistic Automata (Q3090825) (← links)
- Deciding Simulations on Probabilistic Automata (Q3510797) (← links)
- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems (Q3599065) (← links)