On the Expressiveness of TPTL and~MTL

Patricia Bouyer (1) , Fabrice Chevalier (1) , Nicolas Markey (1)

1 LSV - Laboratoire Spécification et Vérification [Cachan]

TPTL and MTL are two classical timed extensions of LTL. In this paper, we positively answer a 15-year-old conjecture that TPTL is strictly more expressive than MTL. But we show that, surprisingly, the TPTL formula proposed by Alur and Henzinger for witnessing this conjecture can be expressed in MTL. More generally, we show that TPTL formulae using only the F modality can be translated into MTL.

Domaines: Logique en informatique [cs.LO]

Patricia Bouyer, Fabrice Chevalier, Nicolas Markey. On the Expressiveness of TPTL and~MTL. Proceedings of the 25th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'05), 2005, Hyderabad, India. pp.432-443, ⟨10.1007/11590156_35⟩. ⟨hal-01194615⟩