MTL with Bounded Variability: Decidability and Complexity
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Model-checking Timed Temporal Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
On the expressiveness of MTL variants over dense time
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
On the expressiveness of MTL with past operators
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Hi-index | 0.00 |
We show that the pointwise version of the logic MTL is strictly less expressive than the continuous version, over finitewords. The proof is constructive in that we exhibit a timed language, which is definable in the continuous semantics but is not definable in the pointwise semantics.