Bisimulation minimization in an automata-theoretic verification framework

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

Volumn 1522, Issue , 1998, Pages 115-132

  Fisler, Kathi ^a   Vardi, Moshe Y ^a  

^a Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CALCULATIONS; COMPUTER AIDED DESIGN; EQUIVALENCE CLASSES; FORMAL METHODS; TEMPORAL LOGIC;

ATOMIC PROPOSITIONS; BISIMULATION RELATIONS; BISIMULATIONS; CONVENTIONAL MODELING; MEMORY USAGE; MU-CALCULUS; SYMBOLIC MODEL CHECKING; VERIFICATION FRAMEWORK;

MODEL CHECKING;

EID: 84928591534     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49519-3_9     Document Type: Conference Paper

References (34)

1. R. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi. An implementation of three algorithms for timing verification based on automata emptiness. In Proc. of the IEEE Real-Time Systems Symposium, pages 157-166, 1992.
2. A. Aziz, V. Singhal, G.M. Swamy, and R.K. Brayton. Minimizing interacting finite state machines: A compositional approach to language containment. In Proc. of the International Conference on Computer Design (ICCD), 1994.
3. R. I. Bahar et al. Algebraic decision diagrams and their applications. In Proc. of the International Conference on Computer-Aided Design, pages 188-191, 1993.
4. I. Beer, S. Ben-David, D. Geist, R. Gewirtzman, and M. Yoeli. Methodology and system for practical formal verification of reactive hardware. In Proc. 6th Conference on Computer Aided Verification, volume 818 of Lecture Notes in Computer Science, pages 182-193, Stanford, June 1994.
5. A. Bouajjani, J.-C. Fernandez, N. Halbwachs, P. Raymond, and C. Ratel. Minimal state graph generation. Science of Computer Programming, 18:247-269, 1992.
6. A. Bouali. XEVE, an ESTEREL verification environment. In Proc. of the Inter- national Conference on Computer-Aided Verification (CAV), pages 500-504, 1998.
7. A. Bouali and R. de Simone. Symbolic bisimulation minimization. In Proc. of the International Conference on Computer-Aided Verification (CAV), pages 96-108, 1992.
8. Y. Choueka. Theories of automata on ω-tapes: A simplified approach. Journal of Computer and System Sciences, 8:117-141, 1974.
9. E.M. Clarke, R. Enders, T. Filkorn, and S. Jha. Exploiting symmetry in temporal logic model checking. Formal Methods in System Design, 9(1/2):77-104, August 1996.
10. E.M. Clarke, O. Grumberg, and D.E. Long. Model-checking and abstraction. In Proc. of the 19th ACM Symposium on Principles of Programming Languages, pages 343-354, 1992.
11. E.M. Clarke and R.P. Kurshan. Computer aided verification. IEEE Spectrum, 33:61-67, 1986.
12. C. Courcoubetis, M.Y. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. Formal Methods in System Design, 1:275-288, 1992.
13. The CUDD package. Available from http://vlsi.colorado.edu/~fabio/.
14. D. Dams. Abstract Interpretation and Partition Refinement for Model Checking. PhD thesis, Technische Universiteit Eindhoven, 1996.
15. D. Dams, O. Grumberg, and R. Gerth. Generation of reduced models for checking fragments of CTL. In Proc. 5th Int.l Conference on Computer-Aided Verification, pages 479-490, 1993.
16. D. Dams, O. Grumberg, and R. Gerth. Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and Systems (TOPLAS), 19(2), March 1997.
17. K. Fisler and M.Y. Vardi. Bisimulation minimization in an automata-theoretic verification framework (extended version). Technical report, Rice University, Department of Computer Science, 1998.
18. J.F. Groote and F. Vaandrager. An efficient algorithm for branching bisimulation and stuttering equivalence. In Proc. of the International Conference on Automata, Languages, and Programming, pages 626-638, 1990.
19. The VIS Group. VIS: A system for verification and synthesis. In R. Alur and T. Henzinger, editors, In the Proc. of the 8th International Conference on Computer Aided Verification, pages 428-432. Springer Verlag, July 1996.
20. O. Grumberg and D.E. Long. Model checking and modular verification. ACM Trans. on Programming Languages and Systems, 16(3):843-871, 1994.
21. V. Gyuris and A. P. Sistla. On-the-fly model checking under fairness that exploits symmetry. In Proc. of International Conference on Computer-Aided Verification (CAV), pages 232-243, 1997.
22. R. Hardin, R.P. Kurshan, S. Shukla, and M.Y. Vardi. A new heuristic for bad cycle detection using BDDs. In Proc. of the International Conference on Computer-Aided Verification, 1997.
23. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of ACM, 32:137-161, 1985.
24. T.A. Henzinger, O. Kupferman, and S. Rajamani. Fair simulation. In Proc. 8th Conference on Concurrency Theory, volume 1243 of Lecture Notes in Computer Science, pages 273-287, Warsaw, July 1997. Springer-Verlag.
25. C. N. Ip and D. L. Dill. Better verification through symmetry. Formal Methods in System Design, 9(1/2):41-76, August 1996.
26. A. Kick. Formula dependent model reduction through elimination of invisible transitions for checking fragments of CTL. Technical Report 1995-27, Universität Karlsruhe, 1995.
27. O. Kupferman and M.Y. Vardi. On the complexity of branching modular model checking. In Proc. 6th Conference on Concurrency Theory, volume 962 of Lecture Notes in Computer Science, pages 408-422, August 1995. Springer-Verlag.
28. R.P. Kurshan. Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, 1994.
29. D. Lee and M. Yannakakis. Online minimization of transition systems. In Proc. 24th ACM Symposium on Theory of Computing, pages 264-274, May 1992.
30. David E. Long. Model-checking, Abstraction, and Compositional Verification. PhD thesis, Carnegie-Mellon University, 1993.
31. R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer Verlag, Berlin, 1980.
32. S. Minato. Binary decision diagrams and applications for VLSI CAD. Kluwer Academic Publishers, 1996.
33. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. First Symposium on Logic in Computer Science, pages 322-331, Cambridge, June 1986.
34. P. Wolper. Expressing interesting properties of programs in propositional temporal logic. In Proc. 13th ACM Symp. on Principles of Programming, pages 184-192, St. Petersburgh, January 1986.