A fast Bisimulation algorithm

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

Volumn 2102, Issue , 2001, Pages 79-90

  Dovier, Agostino ^a   Piazza, Carla ^b   Policriti, Alberto ^b  

^a UNIVERSITY OF VERONA   (Italy)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

Automata; Bisimulation; Non well founded sets; Verification

Indexed keywords

COMPUTER AIDED ANALYSIS; MODEL CHECKING; VERIFICATION;

ALGORITHMIC SOLUTIONS; AUTOMATA; BISIMULATION RELATIONS; BISIMULATIONS; FINITE STRUCTURES; LINEAR SOLUTION; NON WELL-FOUNDED SETS; RELATIONAL COARSEST PARTITION PROBLEMS;

ALGORITHMS;

EID: 84958780189     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44585-4_8     Document Type: Conference Paper

References (21)

1. P. Aczel. Non-well-founded sets,volume 14 of Lecture Notes, Center for the Study of Language and Information. Stanford, 1988.
2. A. Aziz, V. Singhal, G. Swamy, and R. Brayton. Minimizing interacting finite state machines: a compositional approach to language containment. In Proc. Int'l Conference on Computer Design, 1994.
3. J. Barwise and L. Moss. Vicious Circles. On the Mathematics of non-well-founded phenomena. Lecture Notes, Center for the Study of Language and Information. Stanford, 1996.
4. A. Bouajjani, J.C. Fernandez, and N. Halbwachs. Minimal model generation. In E. Clarke and R. Kurshan, editors, Proc. Int'l Conference on Computer-Aided Verification CAV'90, volume 531 of LNCS, pages 197-203. Springer, 1990.
5. A. Bouali. XEVE, an ESTEREL verification environment. In A. J. Hu and M. Y. Vardi, editors, Proc. Int'l Conference on Computer-Aided Verification CAV'98,LNCS, pages 500-504. Springer, 1998.
6. A. Bouali and R. de Simone. Symbolic bisimulation minimization. In Proc. Int'l Conference on Computer-Aided Verification CAV'92, volume 663 of LNCS, pages 96-108. Springer, 1992.
7. R.E. Bryant. Graph based algorithms for Boolean function manipulation. IEEE Transaction on Computers, C-35(8):677-691, 1986.
8. R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: A semantics-based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems (TOPLAS), 15(1):36-72, 1993.
9. A. Dovier, C. Piazza, and A. Policriti. A fast bisimulation algorithm. TR UDMI/14/00/RR, Dip. di Matematica e Informatica, Univ. di Udine, 2000. http://www.dimi.uniud.it/~piazza/bisim.ps.gz.
10. K. Fisler and M.Y. Vardi. Bisimulation and model checking. In Proc. Correct Hardware Design and Verification Methods, volume 1703 of LNCS, pages 338-341. Springer, 1999.
11. M. Forti and F. Honsell. Set theory with free construction principles. Annali Scuola Normale Superiore di Pisa, Cl. Sc., 4(10):493-522, 1983.
12. M.R. Henzinger, T.A. Henzinger, and P.W. Kopke. Computing simulations on finite and infinite graphs. In Proc. 36th IEEE Symp. on Foundations of Computer Science, FOCS 1995, pages 453-462, 1995.
13. G.J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.
14. G.J. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5), 1997.
15. G.J. Holzmann and A. Puri. A minimized automaton representation of reachable states. Software Tools for Technology Transfer, 2(3):270-278, November 1999.
16. J.E. Hopcroft. An n log n algorithm for minimizing states in a finite automaton. In Theory of Machines and Computations, Ed. by Zvi Kohavi and Azaria Paz, pages 189-196. Academic Press, 1971.
17. P.C. Kanellakis and S.A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86(1):43-68, 1990.
18. D. Lee and M. Yannakakis. Online minimization of transition systems. In Proc. 24th ACM Symposium on Theory of Computing, pages 264-274, May 1992.
19. R. Paige and R.E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973-989, 1987.
20. R. Paige, R.E. Tarjan, and R. Bonic. A linear time solution to the single function coarsest partition problem. Theoretical Computer Science, 40(1):67-84, 1985.
21. F. Rahim. Property-dependent modular model checking application to VHDL with computational results. In Proc. Int'l Workshop HLDVT, 1998.