2005 | OriginalPaper | Buchkapitel
On the Expressiveness of TPTL and MTL
verfasst von : Patricia Bouyer, Fabrice Chevalier, Nicolas Markey
Erschienen in: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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 in [4] 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
.