Advertisement

Quantitative Temporal Logic

  • Yoram Hirshfeld
  • Alexander Rabinovich
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1683)

Abstract

We define a quantitative Temporal Logic that is based on a simple modality within the framework of Monadic Predicate Logic. Its canonical model is the real line (and not an ω-sequence of some type). We prove its decidability using general theorems from Logic (and not Automata theory). We show that it is as expressive as any alternative suggested in the literature.

Keywords

Temporal Logic Truth Table Canonical Model Unary Predicate Trace Interval 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AD94]
    R. Alur, D. Dill A theory of timed Automata. Theoretical Computer Science 126 (1994), 183–235.Google Scholar
  2. [AFH96]
    R. Alur, T. Feder, T.A. Henzinger. The Benefits of Relaxing Punctuality. Journal of the ACM 43 (1996) 116–146.Google Scholar
  3. [AH92]
    R. Alur, T.A. Henzinger. Logics and Models of Real Time: a survey. In Real Time: Theory and Practice. Editors de Bakker et al. LNCS 600 (1992) 74–106.CrossRefGoogle Scholar
  4. [AH92a]
    R. Alur, T.A. Henzinger. Back to the future: toward theory of timed regular languages. In 33th FOCS, pp177–186, 1992.Google Scholar
  5. [AH93]
    R. Alur, T.A. Henzinger. Real Time Logic: Complexity and Expressiveness. Information and Computation 104 (1993) 35–77.Google Scholar
  6. [BL95]
    A. Bouajjani and Y. Lakhnech. Temporal Logic +Timed Automata: Expressiveness and Decidability. CONCUR95, LNCS 962, pp. 531–547, 1995.Google Scholar
  7. [BG85]
    J.P. Burges, Y. Gurevich. The Decision Problem for Temporal Logic. Notre Dame J. Formal Logic, 26 (1985) 115–128.Google Scholar
  8. [GHR94]
    D.M. Gabbay, I. Hodkinson, M. Reynolds. Temporal Logics volume 1. Clarendon Press, Oxford (1994).Google Scholar
  9. [GPSS80]
    D.M. Gabbay, A. Pnueli, S. Shelah, J. Stavi. On the Temporal Analysis of Fairness. 7th ACM Symposium on Principles of Programming Languages. Las Vegas (1980) 163–173.Google Scholar
  10. [HRS98]
    T.A. Henzinger, J.F. Raskin, P.Y. Schobbens. The Regular Real Time Languages. 25th ICALP Colloquium (1998).Google Scholar
  11. [HR99]
    Y. Hirshfeld and A. Rabinovich, A Framework for Decidable Metrical Logics. To appear in ICALP99, LNCS vol.1644, 1999.Google Scholar
  12. [Kamp68]
    H. Kamp. Tense Logic and the Theory of Linear Order. Ph.D. thesis, University of California L.A. (1968).Google Scholar
  13. [Rab98]
    A. Rabinovich. On the Decidability of Continuous Time Specification Formalisms. In Journal of Logic and Computation, pp 669–678, 1998.Google Scholar
  14. [Rab98a]
    A. Rabinovich. On the complexity of TL over the reals. Manuscript 1998.Google Scholar
  15. [She75]
    S. Shelah. The monadic theory of order. Ann. of Math., 102, pp 349–419, 1975.Google Scholar
  16. [Trak99]
    B.A. Trakhtenbrot. Dynamic Systems and their interaction: Definitional Suggestions. TR Tel Aviv University, 1999.Google Scholar
  17. [Wilke94]
    T. Wilke. Specifying Time State Sequences in Powerful Decidable Logics and Time Automata. In Formal Techniques in Real Time and Fault Tolerance Systems. LNCS 863 (1994), 694–715.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Yoram Hirshfeld
    • 1
  • Alexander Rabinovich
    • 1
  1. 1.Sackler Faculty of Exact SciencesTel Aviv University

Personalised recommendations