Skip to main content
SpringerLink
Log in

Real Time Temporal Logic: Past, Present, Future

  • Conference paper
Formal Modeling and Analysis of Timed Systems (FORMATS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3829))

Abstract

This paper attempts to improve our understanding of timed languages and their relation to timed automata. We start by giving a constructive proof of the folk theorem stating that timed languages specified by the past fragment of mitl, can be accepted by deterministic timed automata. On the other hand we provide a proof that certain languages expressed in the future fragment of mitl are not deterministic, and analyze the reason for this asymmetry.

This work was partially supported by the European Community project IST-2003-507219 PROSYD (Property-based System Design).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Alur, R.: Timed Automata. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 8–22. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  • Alur, R., Dill, D.L.: A Theory of Timed Automata. Theoretical Computer Science 126, 183–235 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  • Alur, R., Feder, T., Henzinger, T.A.: The Benefits of Relaxing Punctuality. Journal of the ACM 43(1), 116–146 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  • Alur, R., Fix, L., Henzinger, T.A.: Event-Clock Automata: A Determinizable Class of Timed Automata. Theoretical Computer Science 211, 253–273 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  • Alur, R., Henzinger, T.A.: Logics and Models of Real-Time: A Survey. In: Huizing, C., de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.) REX 1991. LNCS, vol. 600, pp. 74–106. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  • Alur, R., Henzinger, T.A.: Back to the Future: Towards a Theory of Timed Regular Languages. In: Proc. FOCS 1992, pp. 177–186 (1992)

    Google Scholar 

  • Asarin, E.: Challenges in Timed Languages. Bulletin of EATCS, vol. 83 (2004)

    Google Scholar 

  • Asarin, E., Caspi, P., Maler, O.: Timed Regular Expressions. The Journal of the ACM 49, 172–206 (2002)

    Article  MathSciNet  Google Scholar 

  • Daws, C., Yovine, S.: Reducing the Number of Clock Variables of Timed Automata. In: Proc. RTSS 1996, pp. 73–81. IEEE, Los Alamitos (1996)

    Google Scholar 

  • Eisner, C., Fisman, D., Havlicek, J., Lustig, Y., McIsaac, A., Van Campenhout, D.: Reasoning with Temporal Logic on Truncated Paths. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 27–39. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  • Geilen, M.C.W.: Formal Techniques for Verification of Complex Real-time Systems. PhD thesis, Eindhoven University of Technology (2002)

    Google Scholar 

  • Henzinger, T.A.: It’s about Time: Real-time Logics Reviewed. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 439–454. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  • Havelund, K., Rosu, G.: Synthesizing Monitors for Safety Properties. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 342–356. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  • Henzinger, T., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic Model-checking for Real-time Systems. Information and Computation 111, 193–244 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  • Hirshfeld, Y., Rabinovich, A.: Logics for Real Time: Decidability and Complexity. Fundamenta Informaticae 62, 1–28 (2004)

    MATH  MathSciNet  Google Scholar 

  • Koymans, R.: Specifying Real-time Properties with with Metric Temporal Logic. Real-time Systems, pp. 255–299 (1990)

    Google Scholar 

  • Kristoffersen, K.J., Pedersen, C., Andersen, H.R.: Runtime Verification of Timed LTL using Disjunctive Normalized Equation Systems. In: Proc. RV 2003. ENTCS, vol. 89(2) (2003)

    Google Scholar 

  • Krichen, M., Tripakis, S.: Black-box Conformance Testing for Real-time Systems. In: Graf, S., Mounier, L. (eds.) SPIN 2004. LNCS, vol. 2989, pp. 109–126. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  • Lichtenstein, O., Pnueli, A., Zuck, L.D.: The Glory of the Past. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol. 193, pp. 196–218. Springer, Heidelberg (1985)

    Google Scholar 

  • Lasota, S., Walukiewicz, L.: Alternating Timed Automata. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 250–265. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  • Maler, O., Nickovic, D.: Monitoring Temporal Properties of Continuous Signals. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol. 3253. Springer, Heidelberg (2004)

    Google Scholar 

  • Maler, O., Pnueli, A.: Tight Bounds on the Complexity of Cascaded Decomposition of Automata. In: Proc. FOCS 1990, pp. 672–682 (1990)

    Google Scholar 

  • Maler, O., Pnueli, A.: Timing Analysis of Asynchronous Circuits using Timed Automata. In: Camurati, P.E., Eveking, H. (eds.) CHARME 1995. LNCS, vol. 987, pp. 189–205. Springer, Heidelberg (1995)

    Google Scholar 

  • Maler, O., Pnueli, A.: On Recognizable Timed Languages. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 348–362. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  • Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, Heidelberg (1995)

    Google Scholar 

  • McNaughton, R., Papert, S.: Counter Free Automata. MIT Press, Cambridge (1971)

    MATH  Google Scholar 

  • Nivat, M., Perrin, D.: Ensembles Reconnaissables de Mots Bi-infinis. Canadian J. of Mathematics 38, 513–537 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  • Ouaknine, J., Worrell, J.: On the Decidability of Metric Temporal Logic. In: Proc. LICS 2005 (2005) (to appear)

    Google Scholar 

  • Pnueli, A.: Verification of Reactive Systems. Lecture Notes, NYU (2003), http://cs.nyu.edu/courses/fall03/G22.3033-007/lecture4.pdf

  • Raskin, J.-F., Schobbens, P.Y., Henzinger, T.A.: Axioms for Real-Time Logics. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 219–236. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  • Safra, S.: On the Complexity of ω-automata. In: Proc. FOCS 1988, pp. 319–327 (1998)

    Google Scholar 

  • Springintveld, J.G., Vaandrager, F.W.: Minimizable Timed Automata. In: Jonsson, B., Parrow, J. (eds.) FTRTFT 1996. LNCS, vol. 1135, pp. 130–147. Springer, Heidelberg (1996)

    Google Scholar 

  • Thati, P., Rosu, G.: Monitoring Algorithms for Metric Temporal Logic Specifications. In: Proc. of RV 2004 (2004)

    Google Scholar 

  • Tripakis, S.: Fault Diagnosis for Timed Automata. In: Damm, W., Olderog, E.-R. (eds.) FTRTFT 2002. LNCS, vol. 2469, pp. 205–224. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  • Vardi, M.Y., Wolper, P.: An Automata-theoretic Approach to Automatic Program Verification. In: Proc. LICS 1986, pp. 322–331. IEEE, Los Alamitos (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Verimag, 2 Av. de Vignate, 38610, Gières, France

    Oded Maler & Dejan Nickovic

  2. Weizmann Institute of Science, Rehovot, 76100, Israel

    Amir Pnueli

  3. New York University, 251 Mercer St., New York, NY, 10012, USA

    Amir Pnueli

Authors
  1. Oded Maler
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dejan Nickovic
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Amir Pnueli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Information Technology, Uppsala University, P.O. Box 337, SE-751 05, Uppsala, Sweden

    Paul Pettersson

  2. Department of Information Technology, Uppsala University, Sweden

    Wang Yi

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maler, O., Nickovic, D., Pnueli, A. (2005). Real Time Temporal Logic: Past, Present, Future. In: Pettersson, P., Yi, W. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2005. Lecture Notes in Computer Science, vol 3829. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11603009_2

Download citation

  • DOI: https://doi.org/10.1007/11603009_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30946-8

  • Online ISBN: 978-3-540-31616-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation