Why so many temporal logics climb up the trees

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

Volumn 1893, Issue , 2000, Pages 629-639

  Rabinovich, Alexander ^a   Maoz, Shahar ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; MODEL CHECKING; RECONFIGURABLE HARDWARE;

BRANCHING TIME; EXPRESSIVE POWER; FINITE SET; LINEAR TIME LOGIC; SECOND LEVEL;

TEMPORAL LOGIC;

EID: 0013360768     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44612-5_58     Document Type: Conference Paper

References (18)

1. E.M. Clarke and E.A. Emerson (1981). Design and verification of synchronous skeletons using branching time temporal logic. LNCS 131:52-71.
2. E.M. Clarke, E.A. Emerson and A.P. Sistla. Automatic verification of finite state concurrent system using temporal logic. In: POPL, 1983.
3. A. Ehrenfeucht. An application of games to the completeness problem for formalized theories. Fundamenta mathematicae 49,129-141,1961.
4. E.A. Emerson (1990). Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B. Elsevier, Amsterdam, 1990.
5. E.A. Emerson (1996). Automated Temporal Reasoning about Reactive Systems. LNCS vol. 1043, pp. 41-101, Springer Verlag 1996.
6. E.A. Emerson and J.Y. Halpern (1982). Decision procedures and expressiveness in the temporal logic of branching time. In STOC'82. pp. 169-180.
7. E.A. Emerson and J.Y. Halpern (1986). 'Sometimes' and 'not never' revisited: on branching versus linear time temporal logics. Journal of the ACM 33(1):151-178.
8. E.A. Emerson and C.L. Lei. Modalities for model checking: branching time strikes back. 12th ACM Symp. on POPL, pp. 84-96, 1985.
9. D. Gabbay, I. Hodkinson and M. Reynolds (1994). Temporal Logic. Oxford University Press.
10. T. Hafer and W. Thomas (1987). Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree. In ICALP'87, LNCS 267:269-279. Springer-Verlag.
11. Y. Hirshfeld and A. Rabinovich (1999). Quantitative Temporal Logic. LNCS 1683:172-187, Springer-Verlag.
12. D. Janin and I. Walukiewicz (1996). On the expressive completeness of the propo-sitional mu-calculus with respect to monadic second order logic. In CONCUR'96, LNCS 1119:263-277, Springer-Verlag.
13. H.W. Kamp (1968). Tense logic and the theory of linear order. PhD Thesis, University of California, Los Angeles.
14. L. Lamport (1980). "Sometimes" is sometimes "not never" - On the temporal logic of programs. In POPL'80. pp. 174-185.
15. S. Maoz (2000). Infinite Hierarchy of Temporal Logics over Branching Time Models. M.Sc. Thesis, Tel-Aviv University.
16. R. Milner (1989). Communication and Concurrency. Prentice-Hall.
17. F. Moller and A. Rabinovich (1999). On the expressive power of CTL*. Proceedings of fourteenth IEEE Symposium on Logic in Computer Science, 360-369.
18. D.M.R. Park (1981). Concurrency and automata on infinite sequences. LNCS 104:168-183.