On the Expressiveness of MTL with Past Operators

  • Pavithra Prabhakar
  • Deepak D’Souza
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4202)


We compare the expressiveness of variants of Metric Temporal Logic (MTL) obtained by adding the past operators ‘S’ and ‘S I ’. We consider these variants under the “pointwise” and “continuous” interpretations over both finite and infinite models. Among other results, we show that for each of these variants the continuous version is strictly more expressive than the pointwise version. We also prove a counter-freeness result for MTL which helps to carry over some results from [3] for the case of infinite models to the case of finite models.


Temporal Logic Stability Point Regular Language Past Operator Periodic Sequence 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alur, R., Feder, T., Henzinger, T.A.: The Benefits of Relaxing Punctuality. Journal of the ACM 43(1), 116–146 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Alur, R., Henzinger, T.A.: Real-time Logics: Complexity and Expressiveness. In: LICS, pp. 390–401. IEEE Computer Society, Los Alamitos (1990)Google Scholar
  3. 3.
    Bouyer, P., Chevalier, F., Markey, N.: On the Expressiveness of TPTL and MTL. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 432–443. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. 4.
    D’Souza, D., Prabhakar, P.: On the expressiveness of MTL in the pointwise and continuous semantics. In: Formal Methods Letters, Software Tools for Technology Transfer (to appear)Google Scholar
  5. 5.
    Kamp, J.A.W.: Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles, California (1968)Google Scholar
  6. 6.
    Koymans, R.: Specifying Real-Time Properties with Metric Temporal Logic. Real-Time Systems 2(4), 255–299 (1990)CrossRefGoogle Scholar
  7. 7.
    McNaughton, R., Papert, S.A.: Counter-Free Automata (M.I.T. research monograph no. 65). MIT Press, Cambridge (1971)Google Scholar
  8. 8.
    Ouaknine, J., Worrell, J.: On the Decidability of Metric Temporal Logic. In: LICS, pp. 188–197. IEEE Computer Society, Los Alamitos (2005)Google Scholar
  9. 9.
    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)CrossRefGoogle Scholar
  10. 10.
    Prabhakar, P., D’Souza, D.: On the expressiveness of MTL with past operators. Technical Report IISc-CSA-TR-2006-5, Indian Institute of Science, Bangalore 560012, India (May 2006), URL:

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Pavithra Prabhakar
    • 1
  • Deepak D’Souza
    • 1
  1. 1.Department of Computer Science and AutomationIndian Institute of ScienceBangaloreIndia

Personalised recommendations