Branching-Time Temporal Logic and Tree Automata

Information and Computation

Volumn 125, Issue 1, 1996, Pages 62-69

  Kupferman, Orna ^a   Grumberg, Orna ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0004455017     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0021     Document Type: Article

References (13)

1. Bernholtz, O., and Grumberg, O. (1993), Branching time temporal logic and script A signmorPℋOus tree automata, in "Proceedings, 4th Conference on Concurrency Theory, Hildesheim, August 1993," Lecture Notes in Computer Science, Vol. 715, pp. 262-277, Springer-Verlag, Berlin/New York.
2. Bernholtz, O., Vardi, M. Y., and Wolper, P. (1994), An automata-theoretic approach to branching-time model checking, in "Computer Aided Verification, Proc. 6th Int. Conference, Stanford, California, June 1994" (D. L. Dill, Ed.), Lecture Notes in Computer Science, Vol. 818, pp. 142-155, Springer-Verlag, Berlin.
3. Clarke, E. M., Emerson, E. A., and Sistla, A. P. (1986), Automatic verification of finite-state concurrent systems using temporal logic specifications, ACM Trans. Programming Languages Systems 8(2), 244-263.
4. Courcoubetis, C., Vardi, M. Y., Wolper, P., and Yannakakis, M. (1992), Memory efficient algorithms for the verification of temporal properties, Formal Methods System Design 1, 275-288.
5. Emerson, E. A., Jutla, C., and Sistla, A. P. (1993), On model-checking for fragments of μ-calculus, in "Computer Aided Verification, Proceedings, 5th International Workshop, Elounda, Crete, June 1993," Lecture Notes in Computer Science, Vol. 697, pp. 385-396, Springer-Verlag, Berlin/New York.
6. Jard, C., and Jeron, T. (1989), On-line model-checking for finite linear temporal logic specifications, in "Automatic Verification Methods for Finite State Systems, Proceedings, International Workshop, Grenoble," Lecture Notes in Computer Science, Vol. 407, pp. 189-196, Springer-Verlag, Berlin/ New York.
7. Muller, D. E., Saoudi, A., and Schupp, P. E. (1986), Alternating automata, the weak monadic theory of the tree and its complexity, in "Proceedings, 13th International Colloquium on Automata, Languages and Programming," Springer-Verlag, Berlin/New York.
8. Pnueli, A. (1981), The temporal semantics of concurrent programs, Theoret. Comput. Sci. 13, 45-60.
9. Rabin, M. O. (1969), Decidability of second order theories and automata on infinite trees, Trans. AMS 141, 1-35.
10. Vardi, M. Y., and Wolper, P. (1986), An automata-theoretic approach to automatic program verification, in "Proceedings of the First Symposium on Logic in Computer Science, Cambridge, June 1986," pp. 322-331.
11. Vardi, M. Y., and Wolper, P. (1986), Automata-theoretic techniques for modal logics of programs, J. Comput. System Sci. 32, 182-211.
12. Vardi, M. Y., and Wolper, P. (1994), Reasoning about infinite computations, Inform, and Comput. 115, 1-37.
13. Wolper, P., and Godefroid, P. (1993), Partial-Order methods for temporal verification, in "Proceedings, 4th Conference on Concurrency Theory, Hildesheim, August 1993," Lecture Notes in Computer Science, Vol. 715, pp. 233-246, Springer-Verlag, Berlin/New York.