Title
On the expressiveness of TPTL and MTL
Abstract
TPTL and MTL are two classical timed extensions of LTL . In this paper, we prove the 20-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 it can be expressed in MTL . More generally, we show that TPTL formulae using only modality F can be translated into MTL .
Year
DOI
Venue
2010
10.1016/j.ic.2009.10.004
Information & Computation
Keywords
Field
DocType
f modality,15-year-old conjecture,tptl formula
Discrete mathematics,Linear temporal logic,Temporal logic,Linear logic,Conjecture,Mathematics,Expressivity
Journal
Volume
Issue
ISSN
208
2
Information and Computation
ISBN
Citations 
PageRank 
3-540-30495-9
42
1.27
References 
Authors
26
3
Name
Order
Citations
PageRank
Patricia Bouyer143529.20
Fabrice Chevalier21267.32
Nicolas Markey394259.47