Formula-dependent equivalence for compositional CTL model checking

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

Volumn 818 LNCS, Issue , 1994, Pages 324-337

  Aziz, Adnan ^a   Shiple, Thomas R ^a   Singhal, Vigyan ^a   Sangiovanni Vincentelli, Alberto L ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS;

BISIMULATIONS; CTL MODEL-CHECKING; EQUIVALENCE TO; EXPLICIT REPRESENTATION; STATE EQUIVALENCES; TRANSITION RELATIONS;

MODEL CHECKING;

EID: 84957716599     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58179-0_65     Document Type: Conference Paper

References (12)

1. A. Aziz and R. K. Brayton. Verifying interacting finite state machines. Technical Report UCB/ERL M93/52, Electronics Research Laboratory, College of Engineering, University of California, Berkeley, July 1993.
2. A. Aziz, T.R. Shiple, V. Singhal, R.K. Brayton, and A.L. Sangiovanni-Vincentelli. Formula-dependent equivalence for compositional CTL model checking. Technical report, Electronics Research Laboratory, College of Engineering, University of California, Berkeley, 1994.
3. A. Bouajjani, J.-C. Fernandez, N Halbwachs, P. Raymond, and C. Ratel. Minimal state graph generation. Science of Computer Programming, 18(31):247-271, 1992.
4. M. C. Browne, E. M. Clarke, and O. Grumberg. Characterizing Kripke structures in temporal logic. Technical Report CS 87-104, Department of Computer Science, Carnegie Mellon University, 1987.
5. M. Chiodo, T. R. Shiple, A. L. Sangiovanni-Vincentelli, and R. K. Brayton. Automatic compositional minimization in CTL model checking. In Proe. Int’l Conf. on Computer-Aided Design, pages 172-178, Nov. 1992.
6. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finitestate concurrent systems using temporal logic specifications. A CM Trans. on Programming Languages and Systems, 8(2):244-263, Apr. 1986.
7. E. M. Clarke, D. E. Long, and K. L. McMillan. Compositional model checking. In 4th Annual Symposium on Logic in Computer Science, Asilomar, CA, June 1989.
8. O. Coudert, C. Berthet, and J. C. Madre. Verification of synchronous sequential machines based on symbolic execution. In J. Sifakis, editor, Proceedings of the Workshop on Automatic Verification Methods for Finite State Systems, volume 407 of Lecture Notes in Computer Science, pages 365-373. Springer-Verlag, June 1989.
9. D. Dams, O. Grumberg, and R. Gerth. Generation of reduced models for checking fragments of CTL. In C. Courcoubetis, editor, Proceedings of the Con]erence on Computer-Aided Verification, volume 697 of Lecture Notes in Computer Science, pages 479-490. Springer-Verlag, June 1993.
10. E. A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 995-1072. Elsevier Science Pubfishers B.V., 1990.
11. O. Grumberg and D.E. Long. Model checking and modular verification. In J. C. M. Baeten and J. F. Groote, editors, CONCUR '91, International Con]erence on Concurrency Theory, volume 527 of Lecture Notes in Computer Science. Springer-Verlag, Aug. 1991.
12. R. Milner. Communication and Concurrency. Prentice Hall, New York, 1989.