Skip to main content
SpringerLink
Log in

On Expressiveness and Complexity in Real-Time Model Checking

  • Conference paper
Automata, Languages and Programming (ICALP 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5126))

Included in the following conference series:

Abstract

Metric Interval Temporal Logic (MITL) is a popular formalism for expressing real-time specifications. This logic achieves decidability by restricting the precision of timing constraints, in particular, by banning so-called punctual specifications. In this paper we introduce a significantly more expressive logic that can express a wide variety of punctual specifications, but whose model-checking problem has the same complexity as that of MITL. We conclude that for model checking the most commonly occurring specifications, such as invariance and bounded response, punctuality can be accommodated at no cost.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

  1. Alur, R., Dill, D.: A theory of timed automata. TCS 126(2), 183–235 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  2. Alur, R., Feder, T., Henzinger, T.A.: The benefits of relaxing punctuality. J. of the ACM 43(1), 116–146 (1996)

    MATH  MathSciNet  Google Scholar 

  3. Alur, R., Henzinger, T.A.: Logics and models of real time: A survey. In: Real-Time: Theory in Practice, Proc. REX Workshop 1991. LNCS, vol. 600, pp. 74–106. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  4. Alur, R., Henzinger, T.A.: Real-time logics: Complexity and expressiveness. Inf. & Comp. 104(1), 35–77 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  5. Alur, R., Madhusudan, P.: Decision problems for timed automata: A survey. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 1–24. Springer, Heidelberg (2004)

    Google Scholar 

  6. Bouyer, P., Markey, N., Ouaknine, J., Worrell, J.: The cost of punctuality. In: Proc. 22nd Ann. IEEE Symp. Logic in Computer Science (LICS 2007), pp. 109–118. IEEE, Los Alamitos (2007)

    Google Scholar 

  7. Comon, H., Cortier, V.: Flatness is not a weakness. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol. 1862, pp. 262–276. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  8. Demri, S., Lazić, R., Nowak, D.: On the freeze quantifier in constraint LTL: Decidability and complexity. Inf. & Comp. 205(1), 2–24 (2007)

    Article  MATH  Google Scholar 

  9. 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 

  10. Henzinger, T.A., Raskin, J.-F., Schobbens, P.-Y.: The regular real-time languages. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 580–591. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  11. Hirshfeld, Y., Rabinovich, A.: Timer formulas and decidable metric temporal logic. Inf. & Comp. 198(2), 148–178 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  12. Koymans, R.: Specifying real-time properties with metric temporal logic. Real-Time Systems 2(4), 255–299 (1990)

    Article  Google Scholar 

  13. Lichtenstein, O., Pnueli, A., Zuck, L.D.: The glory of the past. In: Proc. Conference on Logics of Programs. LNCS, vol. 193, pp. 413–424. Springer, Heidelberg (1985)

    Google Scholar 

  14. Lutz, C., Walther, D., Wolter, F.: Quantitative temporal logics over the reals: PSPACE and below. Inf. & Comp. 205(1), 99–123 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  15. Maler, O., Nickovic, D., Pnueli, A.: From MITL to timed automata. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol. 4202, pp. 274–289. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Ouaknine, J., Worrell, J.: On metric temporal logic and faulty Turing machines. In: Aceto, L., Ingólfsdóttir, A. (eds.) FOSSACS 2006 and ETAPS 2006. LNCS, vol. 3921, pp. 217–230. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  17. Raskin, J.-F.: Logics, Automata and Classical Theories for Deciding Real-Time. PhD thesis, Université de Namur, Belgium (1999)

    Google Scholar 

  18. Reynolds, M.: The complexity of the temporal logic over the reals(submitted 2004)

    Google Scholar 

  19. Wolper, P.: Constructing automata from temporal logic formulas: A tutorial. In: European Educational Forum: School on Formal Methods and Performance Analysis. LNCS, vol. 2090, pp. 261–277. Springer, Heidelberg (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Oxford University Computing Laboratory,  

    Patricia Bouyer, Joël Ouaknine & James Worrell

  2. Laboratoire Spécification & Vérification,  

    Patricia Bouyer & Nicolas Markey

Authors
  1. Patricia Bouyer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nicolas Markey
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Joël Ouaknine
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. James Worrell
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Luca Aceto Ivan Damgård Leslie Ann Goldberg Magnús M. Halldórsson Anna Ingólfsdóttir Igor Walukiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bouyer, P., Markey, N., Ouaknine, J., Worrell, J. (2008). On Expressiveness and Complexity in Real-Time Model Checking. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds) Automata, Languages and Programming. ICALP 2008. Lecture Notes in Computer Science, vol 5126. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70583-3_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70583-3_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70582-6

  • Online ISBN: 978-3-540-70583-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation