Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
426847 | Information and Computation | 2010 | 20 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics