Bisimilarity minimization in o(m logn) time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5606 LNCS, Issue , 2009, Pages 123-142

  Valmari, Antti ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

Analysis of reachability graphs; Verification of systems

Indexed keywords

ANALYSIS OF REACHABILITY GRAPHS; BISIMILARITY; CONSTANT TIME; CORRECTNESS PROOFS; LABELLED DIRECTED GRAPH; LABELLED TRANSITIONS; NUMBER OF STATE; PSEUDO-CODE; TIME CONSUMPTION;

ALGORITHMS; DATA STRUCTURES; GRAPH THEORY; LABELS; PETRI NETS;

SET THEORY;

EID: 70350330663     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02424-5_9     Document Type: Conference Paper

References (12)

1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)
2. Browne, M.C., Clarke, E.M., Grumberg, O.: Characterizing Finite Kripke Structures in Propositional Temporal Logic. Theoret. Comput. Sci. 59, 115-131 (1988)
3. Dovier, A., Piazza, C., Policriti, A.: An Efficient Algorithm for Computing Bisim-ulation Equivalence. Theoret. Comput. Sci. 311, 221-256 (2004)
4. Fernandez, J.-C: An Implementation of an Efficient Algorithm for Bisimulation Equivalence. Science of Computer Programming 13, 219-236 (1989/1990)
5. Gries, D.: Describing an Algorithm by Hopcroft. Acta Inform. 2, 97-109 (1973)
6. Gries, D.: The Science of Programming. Springer, Heidelberg (1981)
7. Hopcroft, J.: An n log n Algorithm for Minimizing States in a Finite Automaton. Technical Report CS-190, Stanford University (1970)
8. 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)
9. Knuutila, T.: Re-describing an Algorithm by Hopcroft. Theoret. Comput. Sci. 250, 333-363 (2001)
10. Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
11. Paige, R., Tarjan, R.: Three Partition Refinement Algorithms. SIAM J. Comput. 16(6), 973-989 (1987)
12. 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/