Abstract
A new algorithm for bisimilarity minimization of labelled directed graphs is presented. Its time consumption is O(m logn), 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 on states with respect to the labelled transitions. A splitter is a pair consisting of a set in the partition and a label. Earlier algorithms consume lots of time in scanning splitters that have no corresponding relevant transitions. The new algorithm avoids this by maintaining the sets of the corresponding transitions. To facilitate this, a refinable partition data structure with amortized constant time operations is introduced. Detailed pseudocode and correctness proof are presented, as well as some measurements.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)
Browne, M.C., Clarke, E.M., Grumberg, O.: Characterizing Finite Kripke Structures in Propositional Temporal Logic. Theoret. Comput. Sci. 59, 115–131 (1988)
Dovier, A., Piazza, C., Policriti, A.: An Efficient Algorithm for Computing Bisimulation Equivalence. Theoret. Comput. Sci. 311, 221–256 (2004)
Fernandez, J.-C.: An Implementation of an Efficient Algorithm for Bisimulation Equivalence. Science of Computer Programming 13, 219–236 (1989/1990)
Gries, D.: Describing an Algorithm by Hopcroft. Acta Inform. 2, 97–109 (1973)
Gries, D.: The Science of Programming. Springer, Heidelberg (1981)
Hopcroft, J.: An n logn Algorithm for Minimizing States in a Finite Automaton. Technical Report CS-190, Stanford University (1970)
Kanellakis, P., Smolka, S.: CCS Expressions, Finite State Processes, and Three Problems of Equivalence. In: 2nd ACM Symposium on Principles of Distributed Computing, pp. 228–240 (1983)
Knuutila, T.: Re-describing an Algorithm by Hopcroft. Theoret. Comput. Sci. 250, 333–363 (2001)
Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
Paige, R., Tarjan, R.: Three Partition Refinement Algorithms. SIAM J. Comput. 16(6), 973–989 (1987)
Valmari, A., Lehtinen, P.: Efficient Minimization of DFAs with Partial Transition Functions. In: Albers, S., Weil, P. (eds.) STACS 2008, Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, pp. 645–656 (2008), http://drops.dagstuhl.de/volltexte/2008/1328/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Valmari, A. (2009). Bisimilarity Minimization in O(m logn) Time. In: Franceschinis, G., Wolf, K. (eds) Applications and Theory of Petri Nets. PETRI NETS 2009. Lecture Notes in Computer Science, vol 5606. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02424-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-02424-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02423-8
Online ISBN: 978-3-642-02424-5
eBook Packages: Computer ScienceComputer Science (R0)