Buy one, get one free!!!

Journal of Logic and Computation

Volumn 6, Issue 4, 1996, Pages 523-539

  Kupferman, Orna ^a   Grumberg, Orna ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Branching time temporal logics; CTL; Model checking; Temporal logic

Indexed keywords

EID: 0000325206     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/6.4.523     Document Type: Article

References (22)

1. 20 states and beyond. Information and Computation, 98, 142-170, 1992.
2. O. Bemholtz and O. Grumberg. Buy one, get one free !!! In Proceedings of the First International Conference on Temporal Logic. Vol. 827 of Lecture Notes in Artificial Intelligence, pp. 210-224, Bonn, July 1994. Springer-Verlag.
3. M. C. Browne. An improved algorithm for the automatic verification of finite state systems using temporal logic. In Proceedings of the First Symposium on Logic in Computer Science, pp. 260-266. Cambridge, June 1986.
4. R. E. Bryant. Graph-based algorithms for boolean-function manipulation. IEEE Transactions on Computers, C-35, 677-691, 1986.
5. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proceedings of the Workshop on Logic of Programs. Vol. 131 of Lecture Notes in Computer Science, pp. 52-71. Springer-Verlag, 1981.
6. E. M. Clarke, E. A. Emerson and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8, 244-263, 1986.
7. E. A. Emerson and E. M. Clarke. Using branching time logic to synthesize synchronization skeletons. Science of Computer Programming, 2, 241-266, 1982.
8. E. A. Emerson and J. Y. Halpern. Sometimes and not never revisited: On branching versus linear time. Journal of the ACM, 33, 151-178, 1986.
9. E. A. Emerson and C.-L. Lei. Modalities for model checking: Branching time logic strikes back. In Proceedings of the Twelfth ACM Symposium on Principles of Programming Languages, pp. 84-96, New Orleans, January 1985.
10. E. A. Emerson. Temporal and modal logic. In Handbook of Theoretical Computer Science, pp. 997-1072. Elsevier Science Publishers, The Netherlands, 1990.
11. E. A. Emerson and A. P. Sistla. Deciding branching time logic. In Proceedings of the 16th ACM Symposium on Theory of Computing, Washington, April 1984.
12. 2 in the SMV package. Laboratory report (Hebrew).
13. O. Grumberg and D. E. Long. Model checking and modular verification. In Proceedings of the 2nd Conference on Concurrency Theory. Vol. 527 of Lecture Notes in Computer Science, pp. 250-265, Springer-Verlag, 1991.
14. L. Lamport. Sometimes is sometimes "not never" - on the temporal logic of programs. In Proceedings of the 7th ACM Symposium on Principles of Programming Languages. pp. 174-185, January 1980.
15. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, USA, 1993.
16. A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13, 45-60, 1981.
17. M. O. Rabin. Weakly definable relations and special automata. In Proceedings of the Symposium on Mathematical Logic and Foundations of Set Theory. pp. 1-23. North Holland, 1970.
18. A. P. Sistla and E. M. Clarke. The complexity of prepositional linear temporal logic. Journal of the ACM, 32, 733-749, 1985.
19. R. E. Tarjan. Depth first search and linear graph algorithms. SIAM Journal of Computing, 1, 146-160, 1972.
20. P. Wolper and P. Godefroid. Partial-order methods for temporal verification. In Proceedings of the 4th Conference on Concurrency Theory. Vol. 715 of Lecture Notes in Computer Science, pp. 233-246, Hildesheim, August 1993. Springer-Verlag.
21. P. Wolper. Specification and synthesis of communicating processes using an extended temporal logic. In Proceedings of the 9th Symposium on Principles of Programming Languageseedings. pp. 20-33, Albuquerque, January 1982.
22. P. Wolper. Temporal logic can be more expressive. Information and Control, 56, 72-99, 1983.