The following pages link to (Q4472257):
Displaying 5 items.
- Probabilistic weak simulation is decidable in polynomial time (Q1029062) (← links)
- From bisimulation to simulation: Coarsest partition problems (Q1431342) (← links)
- An efficient algorithm for computing bisimulation equivalence (Q1884935) (← links)
- An efficient simulation algorithm on Kripke structures (Q2453984) (← links)
- (Q3608040) (← links)