Specifying real-time properties with metric temporal logic
Real-Time Systems
The benefits of relaxing punctuality
Journal of the ACM (JACM)
On the Decidability of Metric Temporal Logic
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
On the expressiveness of MTL in the pointwise and continuous semantics
International Journal on Software Tools for Technology Transfer (STTT) - Special Section on Advances in Automated Verification of Critical Systems
On metric temporal logic and faulty turing machines
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
On the expressiveness of TPTL and MTL
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Comments on temporal logics for real-time system specification
ACM Computing Surveys (CSUR)
Model-checking Timed Temporal Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Counter-free input-determined timed automata
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
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 construction of safety signal automata for MITL[ u, s] using temporal projections
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
| Hi-index | 0.00 |
We compare the expressiveness of variants of Metric Temporal Logic (MTL) obtained by adding the past operators ‘S’ and ‘SI’. We consider these variants under the “pointwise” and “continuous” interpretations over both finite and infinite models. Among other results, we show that for each of these variants the continuous version is strictly more expressive than the pointwise version. We also prove a counter-freeness result for MTL which helps to carry over some results from [3] for the case of infinite models to the case of finite models.