Paper accepted at Concur2020

A paper containing a near-linear time algorithm for weak bisimilarity for Markov chains, by Jansen, Groote, Timmers and Yang has been accepted at Concur 2020. The paper provides an average time O(m log^4 n) algorithm, which is a substantial improvement over the best O(m n) algorithm hitherto known.