论文信息 - Simple Bisimilarity Minimization in O(m log n) Time

Simple Bisimilarity Minimization in O(m log n) Time

A new algorithm for bisimilarity minimization of labelled directed graphs is presented. Its time consumption is O(m log n), where n is the number of states and m is the number of transitions. Unlike earlier algorithms, it meets this bound even if the number of different labels of transitions is not fixed. It is based on refining a partition of states with respect to the labelled transitions. A splitter is a pair consisting of a label and a set in the partition. A transition belongs to a splitter, if and only if it has the same label and its end state is in the set. Earlier algorithms consume lots of time in scanning splitters that have no transitions. The new algorithm avoids this by maintaining also a partition of transitions. To facilitate this, a refinable partition data structure with amortized constant time operations is used. Detailed pseudocode of all nontrivial details is presented. Novel simplifications are applied that both reduce the practical memory consumption and shorten the program code.

Antti Valmari

[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[2] Scott A. Smolka,et al. CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.

[3] William H. Sanders,et al. Optimal state-space lumping in Markov chains , 2003, Inf. Process. Lett..

[4] John E. Hopcroft,et al. An n log n algorithm for minimizing states in a finite automaton , 1971 .

[5] Giuliana Franceschinis,et al. Simple O(m logn) Time Markov Chain Lumping , 2010, TACAS.

[6] Edmund M. Clarke,et al. Characterizing Finite Kripke Structures in Propositional Temporal Logic , 1988, Theor. Comput. Sci..

[7] Antti Valmari,et al. Efficient Minimization of DFAs with Partial Transition , 2008, STACS.

[8] Timo Knuutila,et al. Re-describing an algorithm by Hopcroft , 2001, Theor. Comput. Sci..

[9] Jean-Claude Fernandez,et al. An Implementation of an Efficient Algorithm for Bisimulation Equivalence , 1990, Sci. Comput. Program..

[10] David Gries,et al. Describing an algorithm by Hopcroft , 1973, Acta Informatica.

[11] Robert E. Tarjan,et al. Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[12] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.

[13] Antti Valmari. Bisimilarity Minimization in O(m logn) Time , 2009, Petri Nets.

[14] Agostino Dovier,et al. An efficient algorithm for computing bisimulation equivalence , 2004, Theor. Comput. Sci..