An infinite hierarchy of temporal logics over branching time

Information and Computation

Volumn 171, Issue 2, 2001, Pages 306-332

  Rabinovich, Alexander ^a   Maoz, Shahar ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; HIERARCHICAL SYSTEMS; TREES (MATHEMATICS);

BRANCHING TIME;

FORMAL LOGIC;

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

References (35)

1. Ben-Ari, M., Manna, Z., and Pnueli, A. (1981), The temporal logic of branching time, in "Proceedings of the 8th Annual ACM Symposium on Principles of Programming Languages," pp. 164-176. Assoc. Comput. Mach., New York.
2. Clarke, E. M., and Emerson, E. A. (1981), "Design and Verification of Synchronous Skeletons Using Branching Time Temporal Logic," Lecture Notes in Computer Science, Vol. 131, pp. 52-71, Springer-Verlag, Berlin/New York.
3. Clarke, E. M., Emerson, E. A., and Sistla, A. P. (1983), Automatic verification of finite state concurrent system using temporal logic, in "Proceedings of the 10th Annual ACM Symposium on Principles of Programming Languages."
4. Ebbinghaus, H. D., and Flum, J. (1995), "Finite Model Theory," Springer Perspectives in Mathematical Theory, Springer-Verlag, Berlin.
5. Ehrenfeucht, A. (1961), An application of games to the completeness problem for formalized theories. Fund. Math. 49, 129-141.
6. Emerson, E. A., and Clarke, E. M. (1980), Characterizing correctness properties of parallel programs using fixpoints, in "Proc. 7th Coll. Automata. Languages and Programming (ICALP'80), Noordwijkerhout, NL, July 1980," Lecture Notes in Computer Science, Vol. 85, pp. 169-181, Springer-Verlag, Berlin.
7. Emerson, E. A. (1990), Temporal and modal logic, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), Vol. B. Elsevier, Amsterdam.
8. Emerson, E. A. (1996), Automated temporal reasoning about reactive systems, in "Logics for Concurrency: Structure versus Automata" (F. Moller and G. Birtwistle, Eds.), Lecture Notes in Computer Science, Vol. 1043, pp. 41-101, Springer-Verlag, Berlin.
9. Emerson, E. A., and Halpern, J. Y. (1982), Decision procedures and expressiveness in the temporal logic of branching time, in "Proceedings of the 14th Annual ACM Symposium of Theory of Computing," pp. 169-180, Assoc. Comput. Mach., New York.
10. Emerson, E. A., and Halpern, J. Y. (1986). 'Sometimes' and 'not never' revisited: On branching versus linear time temporal logics, J. Assoc. Comput. Mach. 33, 151-178.
11. Emerson, E. A., and Lei, C. I., (1985), Modalities for model checking: Branching time strikes back, in "12th ACM Symp. on Principles of Prog. Lang.," pp. 84-96.
12. Etessami, K., and Wilke, T. (1996), An until hierarchy for temporal logic, in "Proceedings 11th Annual IEEE Symposium on Logic in Computer Science," pp. 108-117.
13. Gabbay, D., Hodkinson, I., and Reynolds, M. (1994), "Temporal Logic," Oxford Univ. Press, London.
14. Gabbay, D., Pnueli, A., Shelah, S., and Stavi, J. (1981), On the temporal analysis of fairness, in "7th ACM Symp. on Principles of Prog. Lang.," pp. 163-173.
15. Gurevich, Y., and Shelah, S. (1985), The decision problem for branching time logic, J. Symbolic Logic 50, 668-681.
16. Gale, D., and Stewart, F. (1953), Infinite games with perfect information, Ann. Math. Stud. 28, 245-266.
17. Hafer, T., and Thomas, W. (1987), Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree, in "Proceedings of ICALP'87: International Colloquium on Automata. Languages and Programming," Lecture Notes in Computer Science, Vol. 267. pp. 269-279, Springer-Verlag, Berlin.
18. Hirshfeld, Y., and Rabinovich. A. (1999), Quantitative temporal logic, in "Computer Science Logic 1999," Lecture Notes in Computer Science, Vol. 1683, pp. 172-187, Springer-Verlag, Berlin.
19. Hirshfeld, Y., and Rabinovich, A. (2000), "On the Expressive Power of Temporal Logics over the Reals," Technical Report, Tel-Aviv University.
20. Hodges, W. (1997), "A Shorter Model Theory," Cambridge Univ. Press, Cambridge, UK.
21. Immerman, N. (1998), "Descriptive Complexity," Springer-Verlag, Berlin.
22. Janin, D., and Walukiewicz, I. (1996), On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic, in "Proceedings of CONCUR'96: International Conference on Concurrency Theory," Lecture Notes in Computer Science, Vol. 1119, pp. 263-277, Springer-Verlag, Berlin.
23. Kamp, H. W. (1968), "Tense Logic and the Theory of Linear Order," Ph.D. thesis, University of California, Los Angeles.
24. Kupferman, O., and Grumberg, O. (1996), Buy one, get one free!!! J. Logic Comput. 6, 523-539.
25. Lamport, L., (1980). "Sometimes" is sometimes "not never"-On the temporal logic of programs, in "Proceedings of the 7th Annual ACM Symposium on Principles of Programming Languages," pp. 174-185, Assoc. Comput. Mach., New York.
26. Maoz, S. (2000), "Infinite Hierarchy of Temporal Logics over Branching Time Models," M.Sc. thesis, Tel-Aviv University.
27. Milner, R. (1989), "Communication and Concurrency," Prentice-Hall, Englewood Cliffs, NJ.
28. Moller, F., and Rabinovich, A. (1999), On the expressive power of CTL*, in "Proceedings of fourteenth IEEE Symposium on Logic in Computer Science," pp. 360-369.
29. Park, D. M. R. (1981), "Concurrency and Automata on Infinite Sequences," Lecture Notes in Computer Science, Vol. 104, pp. 168-183, Springer-Verlag, Berlin/New York
30. Pnueli, A. (1977), The temporal logic of programs, in "Proceedings of Eighteenth IEEE Symposium on Foundations of Computer Science," pp. 46-57.
31. Rabin, M. O. (1969), Decidability of second order theories and automata on infinite trees, in Trans. Amer. Math. Soc. 141, 1-35.
32. Rabinovich, A., and Maoz, S. (2000), Why so many temporal logics climb up the trees? in "Proceedings of MFCS 2000," Lecture Notes in Computer Science, Vol. 1893, Springer-Verlag, Berlin.
33. +," Research Report LSV-00-8, Lab. Specification and Verification, ENS de Cachan, Cachan, France.
34. Rosenstein, J. G. (1982), "Linear Orderings," Academic Press, New York.
35. Vardi, M., and Wolper, P. (1984), Yet another process logic, in "Logics of Programs," Lecture Notes in Computer Science, Vol. 164, pp. 501-512, Springer-Verlag, Berlin.