In these talks the students present papers on bisimulations algorithms. Back to Start page
Title | Authors | Reference Papers |
---|---|---|
When simulation meets antichain (on checking language inclusion of NFAs) | Abdulla et. al. | paper |
Bisimulation minimization in O(m log n) time | A. Valmari | paper |
Three partition refinement algorithms | R. Paige and R.E. Tarjan | paper |
Checking NFA equivalence with bisimulations up to congruence | F. Bonchi and D. Pous | paper |
An O(m log n) algorithm for stuttering equivalence and branching bisimulation | J.F. Groote and A. Wijs | paper |