A Really Temporal Logic

Journal of the ACM (JACM)

Volumn 41, Issue 1, 1994, Pages 181-203

  Alur, Rajeev ^a   Henzinger, Thomas A ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b Cornell University ^*  (United States)

Author keywords

dense time; discrete time; EXPSPACE completeness; linear time temporal logic; model checking; real time requirements

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER SIMULATION; DECISION TABLES; DECISION THEORY; FORMAL LANGUAGES; NATURAL LANGUAGE PROCESSING SYSTEMS; REAL TIME SYSTEMS; SOFTWARE ENGINEERING;

COMPLETENESS; DENSE TIME; DISCRETE TIME; FREEZE QUANTIFIER; LINEAR TIME TEMPORAL LOGIC; LOGICS OF PROGRAMS; MECHANICAL VERIFICATION; MODEL CHECKING; PROGRAM VERIFICATION; TEMPORAL LOGIC;

FORMAL LOGIC;

EID: 0028202370     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/174644.174651     Document Type: Article

References (32)

1. ABADI, M., AND LAMPORT, L. 1992. An old-fashioned recipe for real time. In Real Time: Theory in Practice. J. W. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, eds. Lecture Notes in Computer Science, vol. 600. Springer-Verlag, New York, pp. 1-27.
2. ALUR, R., COURCOUBETIS, C., AND DILL, D. L. 1990. Model checking for real-time systems. In Proceedings of the 5th Annual Symposium on Logic in Computer Science, IEEE Computer Society Press, New York, pp. 414-425.
3. ALUR, R., FEDER, T., AND HENZINGER, T. A. 1991. The benefits of relaxing punctuality. In Proceedings of the 10th Annual Symposium on Principles of Distributed Computing, (Montreal, Que., Canada, Aug. 19-21). ACM, New York, pp. 139-152.
4. ALUR, R., AND HENZINGER, T. A. 1989. A really temporal logic. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, New York, pp. 164-169.
5. ALUR, R., AND HENZINGER, T. A. 1990. Real-time logics: Complexity and expressiveness. In Proceedings of the 5th Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, New York, pp. 390-401.
6. ALUR, R., AND HENZINGER, T. A., 1992. Logics and models of real time: A survey. In Real Time: Theory in Practice. J. W. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, eds. Lecture Notes in Computer Science, vol. 600. Springer-Verlag, New York, pp. 74-106.
7. BEN-ARI, M., MANNA, Z., AND PNUELI, A. 1981. The temporal logic of branching time. In Proceedings of the 8th Annual Symposium on Principles of Programming Languages (Williamsburg, Va., Jan. 26-28). ACM, New York, pp. 164-176.
8. BERNSTEIN, A., AND HARTER, P. K., JR. 1981. Proving real-time properties of programs with temporal logic. In Proceedings of the 8th Annual Symposium on Operating System Principles (Pacific Grove, Calif., Dec. 14-16). ACM, New York, pp. 1-11.
9. EMERSON, E. A., MOK, A. K., SISTLA, A. P., AND SRINIVASAN, J. 1990. Quantitative temporal reasoning. In CAV 90: Computer-aided Verification. E. M. Clarke and R. P. Kurshan, eds. Lecture Notes in Computer Science, vol. 531. Springer-Verlag, New York, pp. 136-145.
10. GABBAY, D., PNUELI, A., SHELAH, S., AND STAVI, J. 1980. On the temporal analysis of fairness. In Proceedings of the 7th Annual ACM Symposium on Principles of Programming Languages (Las Vegas, Nev., Jan 28-30). ACM, New York, pp. 163-173.
11. HALPERN, J. Y. 1991. Presburger arithmetic with unary predicates is II-complete. J. Symb. Logic 56, 2, 637-642.
12. HAREL, E. 1988. Temporal analysis of real-time systems. Master's thesis, The Weizmann Institute of Science, Rehovot, Israel.
13. HAREL, E., LICHTENSTEIN, O., AND PNUELI, A. 1990. Explicit-clock temporal logic. In Proceedings of the 5th Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, New York, pp. 402-413.
14. HAREL, D., PNUELI, A., AND STAVI, J. 1983. Propositional dynamic logic of regular programs. J. Comput. Syst. Sci., 26, 2, 222-243.
15. HENZINGER, T. A. 1990. Half-order modal logic: How to prove real-time properties. In Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing (Quebec City, Que., Canada, Aug. 22-24). ACM, New York, pp. 281-286.
16. HENZINGER, T. A. 1991. The Temporal Specification and Verification of Real-time Systems. Ph.D. dissertation, Stanford Univ., Stanford, Calif.
17. HENZINGER, T. A., MANNA, Z., AND PNUELI, A. 1992. What good are digital clocks? In ICALP 92: Automata, Languages, and Programming. W. Kuich, ed. Lecture Notes in Computer Science, vol. 623. Springer-Verlag, New York, pp. 545-558.
18. HOPCROFT, J. E., AND ULLMAN, J. D. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass.
19. JAHANIAN, F., AND MOK, A. K. 1986. Safety analysis of timing properties in real-time systems. IEEE Trans. Softw. Eng. SE-12, 9, 890-904.
20. KOYMANS, R. 1990. Specifying real-time properties with metric temporal logic. Real-time Systems 2, 4, 255-299.
21. LICHTENSTEIN, O., AND PNUELI, A. 1985. Checking that finite state concurrent programs satisfy their linear specification. In Proceedings of the 12th Annual ACM Symposium on Principles of Programming Languages (New Orleans, La., Jan. 14-16). ACM, New York, pp. 97-107.
22. MANNA, Z., AND PNUELI, A. 1992. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, New York.
23. MANNA, Z., AND WOLPER, P. 1984. Synthesis of communicating processes from temporal logic specifications. ACM Trans. Prog. Lang. Syst. 6, 1, 68-93.
24. OSTROFF, J. S. 1990. Temporal Logic of Real-Time Systems. Research Studies Press, Taunton, England.
25. OWICKI, S., AND LAMPORT, L. 1982. Proving liveness properties of concurrent programs. ACM Trans. Prog. Lang. Syst. 4, 3, 455-495.
26. PNUELI, A. 1977. The temporal logic of programs. In Proceedings of the 18th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, New York, pp. 46-57.
27. PNUELI, A., AND HAREL, E. 1988. Applications of temporal logic to the specification of real-time systems. In Formal Techniques in Real-Time and Fault-Tolerant Systems. M. Joseph, ed Lecture Notes in Computer Science, vol. 331. Springer-Verlag, New York, pp. 84-93.
28. PRATT, V. R. 1980. A near-optimal method for reasoning about action. J. Comput. Syst. Sci. 20, 2, 231-254.
29. ROGERS, H., JR. 1967. Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York.
30. SISTLA, A. P., AND CLARKE, E. M. 1985. The complexity of propositional linear temporal logics. J. ACM 32, 3, 733-749.
31. SMULLYAN, R. M. 1968. First-Order Logic. Springer-Verlag, New York.
32. WANG, F., MOK, A. K., AND EMERSON, E. A. 1992. Asynchronous propositional temporal logic. In Proceedings of the 12th International Conference of Software Engineering.