Expressive power of temporal logics

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

Volumn 2421 LNCS, Issue , 2002, Pages 57-76

  Rabinovich, Alexander ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EXPRESSIVE POWER;

TEMPORAL LOGIC;

EID: 23044533237     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45694-5_4     Document Type: Conference Paper

References (38)

1. D. Beauquier and A. Rabinovich (2002). Monadic Logic of Order over Naturals Has no Finite Base. Journal on Logic and Computations 12:(2) pp 243-253.
2. M. Ben-Ari, Z. Manna and A. Pnueli (1981). The temporal logic of branching time. In Proceedings of the 8th Annual ACM Symposium on Principles of Programming Languages, ACM, New York, pp. 164-176.
3. E.M. Clarke and E.A. Emerson (1981). Design and verification of synchronous skeletons using branching time temporal logic. Lecture Notes in Computer Science 131:52-71.
4. E.M. Clarke, E.A. Emerson and A.P. Sistla (1983). Automatic verification of finite state concurrent system using temporal logic. In Proceedings of the 10th Annual ACM Symposium on Principles of Programming Languages.
5. E. Clarke and B.H. Schlingloff (1999). Model checking. In A. Robinson and A. Voronkov, editors, Handbook on Automated Reasoning, pages 3-157. Elsevier Science Publishers B.V.
6. E. A. Emerson and E. M. Clarke (1980). Characterizing correctness properties of parallel programs using fixpoints. In Proc. 7th Coll. Automata, Languages and Programming (ICALP'80), Noordwijkerhout, NL, volume 85 of Lecture Notes in Computer Science, pages 169-181. Springer, 1980.
7. E.A. Emerson (1990). Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B. Elsevier, Amsterdam, 1990.
8. E.A. Emerson (1996). Automated temporal reasoning about reactive systems. Logics for Concurrency: Structure versus Automata, F. Moller and G. Birtwistle (eds.), Springer LNCS no. 1043, pp. 41-101, 1996.
9. E.A. Emerson and J.Y. Halpern (1982). Decision procedures and expressiveness in the temporal logic of branching time. In Proceedings of the 14th Annual ACM Symposium of Theory of Computing, ACM, New York, 1982. pp. 169-180.
10. 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.
11. E.A. Emerson and C.L. Lei. Modalities for model checking: branching time strikes back. 12th ACM Symp. on Principles of Prog. Lang., pp. 84-96, 1985.
12. D. Gabbay, I. Hodkinson and M. Reynolds (1994). Temporal Logic. Oxford University Press.
13. D. Gabbay, A. Pnueli, S. Shelah and J. Stavi (1980). On the temporal analysis of fairness. 7th ACM Symp. on Principles of Prog. Lang., pp. 163-173, 1980.
14. Y. Gurevich and S. Shelah, "To the decision problem for branching time logic", In "Foundations of Logic and Linguistics: Problems and their Solutions" (ed. P. Weingartner and G. Dold), Plenum, 1985, 181-198.
15. Y. Gurevich and S. Shelah (1985). The decision problem for branching time logic. Journal of Symbolic Logic 50(3):668-681.
16. * 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 267:269-279, Springer-Verlag.
17. Y. Hirshfeld and A. Rabinovich (2000). Future temporal logic needs infinitely many modalities. Technical Report, Tel-Aviv University.
18. D. Janin and I. Walukiewicz (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 1119:263-277, Springer-Verlag.
19. H. W. Kamp (1968). Tense logic and the theory of linear order. PhD Thesis, University of California, Los Angeles.
20. L. Lamport (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, ACM, New York, 1980. pp. 174-185.
21. F. Laroussinie and Ph. Schnoebelen (2000). Specification in CTL+Past for verification in CTL. Information and Computation, 156(1/2):236-263.
22. S. Maoz (2000). Infinite Hierarchy of Temporal Logics over Branching Time Models. M. Sc. Thesis, Tel-Aviv University.
23. R. McNaughton and S. Papert (1971). Counter-Free Automata. MIT Press, 1971.
24. R. Milner (1989). Communication and Concurrency. Prentice-Hall.
25. *. Proceedings of fourteenth IEEE Symposium on Logic in Computer Science, 360-369.
26. *: On the Expressive power of Monadic Path Logic. Submitted.
27. D.M.R. Park (1981). Concurrency and automata on infinite sequences. Lecture Notes in Computer Science 104:168-183.
28. A. Pnueli (1977). The temporal logic of programs. In Proc. IEEE 18th Annu. Symp. on Found. Comput. Sci., pages 46-57, New York, 1977. IEEE.
29. A. Prior (1967). Past, Present and Future. Claredon Press, Oxford.
30. M. O. Rabin (1969). Decidability of second order theories and automata on infinite trees. In Trans. Amer. Math. Soc., 141, pp 1-35.
31. J.-P. Queille and J. Sifakis (1983). Fairness and related properties in transition systems. A temporal logic to deal with fairness. Acta Informatica, 19(3):195-220.
32. A. Rabinovich and S. Maoz (2001). An Infinite Hierarchy of Temporal Logics over Branching Time. Information and Computation, 171:306-332, 2001.
33. +. Research Report LSV-00-8, Lab. Specification and Verification, ENS de Cachan, Cachan, France, October 2000.
34. J. Stavi (1979). Functional Completeness over the rationals. Unpublished, Bar Ilan University, Israel, 1979.
35. C. Stirling (1992). Modal and temporal logics. In Handbook of Logic in Computer Science, Oxford University press, 476-567.
36. W. Thomas 1990). Automata on Infinite Objects. In J. van Leeuwen editor Handbook of Theoretical Computer Science, The MIT Press.
37. W. Thomas (1997). Languages, Automata, and Logic. In Handbook of Formal Language Theory (G. Rozenberg, A. Salomaa, Eds.), Vol. III, Springer-Verlag, New York, pp. 389-455.
38. M. Vardi and P. Wolper (1984). Yet another process logic. In Logics of Programs, Lecture Notes in Computer Science 164, 501-512, Springer-Verlag.