[JansenGKW20]
An O(m log n) algorithm for branching bisimilarity on labelled transition
systems
In TACAS (2), pages 3-20, Springer, Lecture Notes in Computer Science 12079, 2020.
Downloads: bibURL: https://doi.org/10.1007/978-3-030-45237-7_1