Advertisement
Published in:
2005 | OriginalPaper | Chapter
On the Expressiveness of TPTL and MTL
Authors : Patricia Bouyer, Fabrice Chevalier, Nicolas Markey
Published in: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. 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
.