Rajeev Alur
Skip Abstract Section
Abstract
We introduce a temporal logic for the specification of real-time systems. Our logic, TPTL, employs a novel quantifier construct for referencing time: the freeze quantifier binds a variable to the time of the local temporal context.
TPTL is both a natural language for specification and a suitable formalism for verification. We present a tableau-based decision procedure and a model-checking algorithm for TPTL. Several generalizations of TPTL are shown to be highly undecidable.
- ~ABADI, M., AND LAMPORT, L. 1992. An old-fashioned recipe for real time. In Real Time: Theo~ ~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. Google Scholar
- ~ALUR, R., COURCOUBETtS, C., AND DILL, D. L. 1990. Model checking for real-time systems. In ~Proceedings of the 5th Annual Sympostum on Logic in Computer Science, IEEE Computer Society ~Press, New York, pp. 414-425.Google Scholar
- ~ALUR, R., FEDER, T., AND HENZINGER, T. A. 1991. The benefits of relaxing punctuality. In ~Proceedings of the lOth Annual Symposium on Principles of Distributed Computing, (Montreal, ~Que., Canada, Aug. 19-21). ACM, New York, pp. 139-152. Google Scholar
- ~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.Google Scholar
- ~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.Google Scholar
- ~ALUR, R., AND HENZINGER, T. m., 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. Google Scholar
- ~BEN-Am, M., MANNA, Z., AND PNUELI, A. 1981. The temporal logic of branching time. In ~Proceedings of the 8th Annual Symposium on Prmciples of Programming Languages (Williamsburg, ~Va., Jan. 26-28). ACM, New York, pp. 164-176. Google Scholar
- ~BERNSTEIN, h., 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. Google Scholar
- ~EMERSON, E. A., MOK, h. K., SISTLA, h. P., AND SRIN1VASAN, 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. Google Scholar
- ~GABBAY, D., PNUEL{, 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. Google Scholar
- ~HALPERN, J. Y. 1991. Presburger arithmetic with unary predicates is II}-complete. J. Symb. ~Logic 56, 2, 637-642. Google Scholar
- ~HAREL, E. 1988. Temporal analysis of real-time systems. Master's thesis, The Weizmann ~Institute of Science, Rehovot, Israel.Google Scholar
- ~HAREL, E., LICHTENSTEIN, O., AND PNUELI, h. 1990. Explicit-clock temporal logic. In Proceedings ~of the 5th Annual Symposium on Logic in Computer Sctence. IEEE Computer Society Press, New ~York, pp. 402-413.Google Scholar
- ~HAREL, D., PNUELI, h., AND STAVI, J. 1983. Propositional dynamic logic of regular programs. J. ~Comput. Syst. Sct., 26, 2, 222-243.Google Scholar
- HENZINGER, T. h. 1990. Half-order modal logic: How to prove real-time properties. In Proceed- ~ings of the 19th Annual ACM Symposium on Principles of Distributed Computing (Quebec City, ~Que., Canada, Aug. 22-24). ACM, New York, pp. 281-286. Google Scholar
- ~HENZINGER, T. A. 1991. The Temporal Specification and Verification of Real-time Systems. ~Ph.D. dissertation, Stanford Univ., Stanford, Calif. Google Scholar
- ~HENZINGER, T. A., MANNA, g., AND PNUELI, h. 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. Google Scholar
- ~HOPCROFT, J. E., AND ULLMAN, J. D. 1979. Introduction to Automata Theoty, Languages, and ~Computation. Addison-Wesley, Reading, Mass. Google Scholar
- ~JAHANIAN, F., AND MOK, h. K. 1986. Safety analysis of timing properties in real-time systems. ~IEEE Trans. Softw. Eng. SE-12, 9, 890-904. Google Scholar
- ~KOYMANS, R. 1990. Specifying real-time properties with metric temporal logic. Real-time Systems ~ 2, 4, 255-299. Google Scholar
- ~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 Prmciples of ~ProgrammmgLanguages (New Orleans, La., Jan. 14-16). ACM, New York, pp. 97 107. Google Scholar
- ~MANNA, Z., AND PNUELi, A. 1992. The Temporal Logic of Reactit,e and Concurrent Systems: ~ Specification. Springer-Verlag, New York. Google Scholar
- ~MANNA, Z., AND WOLPER, P. 1984. Synthesis of communicating processes from temporal logic ~specifications. ACM Trans. Prog. Lang. Syst. 6, 1, 68-93. Google Scholar
- ~OSTROFF, J. S. 1990. Temporal Logic of Real-Time Systems. Research Studies Press, Taunton, ~England. Google Scholar
- ~OWICKI, S., AND LAMPORT, L. 1982. Proving liveness properties of concurrent programs. ACM ~Trans. Prog. Lang. Syst. 4, 3, 455-495. Google Scholar
- PNUEU, A. 1977. The temporal logic of programs. In Proceedings of the 18th Annual Symposmm on Foundations of Computer Science. IEEE Computer Society Press, New York, pp. 46-57.Google Scholar
- ~PNUELL A., AND HAREL, E. 1988. Applications of temporal logic to the specification of real-time ~systems. In Formal Techmques in Real-Time and Fault-Tolerant Systems. M. Joseph, ed Lecture ~Notes m Computer Science, vol. 331. Springer-Verlag, New York, pp. 84-93. Google Scholar
- ~PRATt, V. R. 1980. A near-optimal method for reasoning about action. J. Comput. Syst. Sci. 20, ~2, 231-254.Google Scholar
- ~ROGERS, H., JR. 1967. Theory of Recursive Functions and Effectwe Computabdtty. McGraw-Hill, ~New York. Google Scholar
- ~SISTLA, A. P., AND CLARKE, E. U. 1985. The complexity of propositional linear temporal logics. ~J. ACM 32, 3, 733-749. Google Scholar
- ~SMULLYAN, R. M. 1968. First-Order Logic. Springer-Verlag, New York.Google Scholar
- ~WANG, F., MOK, h. K., AND EMERSON, E. h. 1992. Asynchronous propositional temporal logic. ~In Proceedings of the 12th hzternatlonal Conference of Software Engmeenng.Google Scholar
Index Terms
- A really temporal logic
Recommendations
A Paraconsistent Linear-time Temporal Logic
Inconsistency-tolerant reasoning and paraconsistent logic are of growing importance not only in Knowledge Representation, AI and other areas of Computer Science, but also in Philosophical Logic. In this paper, a new logic, paraconsistent linear-time ...
Refutation-Aware Gentzen-Style Calculi for Propositional Until-Free Linear-Time Temporal Logic
AbstractThis study introduces refutation-aware Gentzen-style sequent calculi and Kripke-style semantics for propositional until-free linear-time temporal logic. The sequent calculi and semantics are constructed on the basis of the refutation-aware setting ...
Logical foundations for more expressive declarative temporal logic programming languages
In this article, we present a declarative propositional temporal logic programming language called TeDiLog that is a combination of the temporal and disjunctive paradigms in logic programming. TeDiLog is, syntactically, a sublanguage of the well-known ...
Comments