An O(m log n) Algorithm for Stuttering Equivalence and Branching Bisimulation

Jan Friso Groote, Anton Wijs

We provide a new algorithm to determine stuttering equivalence with time complexity $O(m\log n)$, where $n$ is the number of states and $m$ is the number of transitions of a Kripk…