Skip to main content
SpringerLink
Log in

On the expressiveness of MTL in the pointwise and continuous semantics

  • FORMAL METHODS LETTER
  • Published:
International Journal on Software Tools for Technology Transfer Aims and scope Submit manuscript

Abstract

We show that the pointwise version of the logic MTL is strictly less expressive than the continuous version, over finitewords. The proof is constructive in that we exhibit a timed language, which is definable in the continuous semantics but is not definable in the pointwise semantics.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  3. Alur, R., Henzinger, T.A.: Real-time logics: complexity and expressiveness. In: Proc. LICS 1990, pp. 390–401(1990)

  4. Bouyer, P., Chevalier, F., Markey, N.: On the expressiveness of TPTL and MTL.In: Proc. FSTTCS’05. LNCS 3821, pp. 432–443(2005)

  5. D’Souza, D., Prabhakar, P.: On the expressiveness of MTL in the pointwiseand continuous semantics. Technical Report IISc-CSA-TR-2005-7,IISc, India(2005)

  6. D’Souza, D., Tabareau, N.: On timed automata with input-determined guards. In: Proc. FORMATS/FTRTFT. LNCS 325368–83(2004)

    Google Scholar 

  7. Henzinger, T.A., Raskin, J.F., Schobbens, P.Y.: The regular real-time languages. In: Proc. ICALP. LNCS 1443580–591(1998)

    MathSciNet  Google Scholar 

  8. Koymans, R.: Specifying real-time properties with metric temporallogic. Real-Time Syst. 2(4)255–299(1990)

    Article  Google Scholar 

  9. Lasota, S., Walukiewicz, I.: Alternating timed automata. In: Proc. FoSSaCS. LNCS 3441250–265(2005)

    MathSciNet  Google Scholar 

  10. Lozes, É.: Adjuncts elimination in the static ambient logic. Electron. Notes Theor. Comput. Sci. 9651–72(2004)

  11. Ouaknine, J., Worrell, J.: On the decidability of metric temporal logic.In: Proc. LICS 2005, pp. 188–197(2005)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Automation, Indian Institute of Science, Bangalore, 560012, India

    Deepak D’Souza & Pavithra Prabhakar

Authors
  1. Deepak D’Souza
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pavithra Prabhakar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Deepak D’Souza.

Rights and permissions

Reprints and permissions

About this article

Cite this article

D’Souza, D., Prabhakar, P. On the expressiveness of MTL in the pointwise and continuous semantics. Int J Softw Tools Technol Transfer 9, 1–4 (2007). https://doi.org/10.1007/s10009-005-0214-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10009-005-0214-9

Keywords

Search

Navigation