Simple Bisimilarity Minimization in O(m log n) Time

DOI10.3233/FI-2010-369zbMath1209.68344MaRDI QIDQ3084988

Antti Valmari

Publication date: 28 March 2011

Published in: Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

transitionssplitterbisimilarity minimization of labelled directed graphs

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

An efficient algorithm to determine probabilistic bisimulation, Fast brief practical DFA minimization, From generic partition refinement to weighted tree automata minimization, An aperiodic set of 11 Wang tiles