====== Talks on Bisimulation ======
In these talks the students present papers on bisimulations algorithms.
[[start|Back to Start page]]
----

^Title ^ Authors ^ Reference Papers ^
|When simulation meets antichain (on checking language inclusion of NFAs)|Abdulla et. al.|{{:Papers:tacas10.pdf|paper}}|
|Bisimulation minimization in O(m log n) time	|A. Valmari	|{{:Papers:bisimulation.pdf|paper}}|
|Three partition refinement algorithms	|R. Paige and R.E. Tarjan	|{{:Papers:3partref.pdf|paper}}|
|Checking NFA equivalence with bisimulations up to congruence	|F. Bonchi and D. Pous	|{{:Papers:hkc.pdf|paper}}|
|An O(m log n) algorithm for stuttering equivalence and branching bisimulation	|J.F. Groote and A. Wijs	|{{:Papers:mlogn-stutter-bisimulation.pdf|paper}}|