Specifying real-time properties with metric temporal logic
Real-Time Systems
Handbook of theoretical computer science (vol. B)
Real-time logics: complexity and expressiveness
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
The benefits of relaxing punctuality
Journal of the ACM (JACM)
Automated deductive requirements analysis of critical systems
ACM Transactions on Software Engineering and Methodology (TOSEM)
The complexity of propositional linear temporal logics in simple cases
Information and Computation
Temporal Logic with Forgettable Past
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Logics and Models of Real Time: A Survey
Proceedings of the Real-Time: Theory in Practice, REX Workshop
An Until Hierarchy for Temporal Logic
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
The complexity of the temporal logic with "until" over general linear time
Journal of Computer and System Sciences
Theoretical Computer Science
Future temporal logic needs infinitely many modalities
Information and Computation
The stuttering principle revisited
Acta Informatica
Logics for Real Time: Decidability and Complexity
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
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
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Back to the future: towards a theory of timed regular languages
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Expressiveness of metric modalities for continuous time
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Real time temporal logic: past, present, future
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Integrating discrete- and continuous-time metric temporal logics through sampling
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
FORMATS'06 Proceedings of the 4th 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
On the expressiveness of TPTL and MTL
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Automated Verification of Dense-Time MTL Specifications Via Discrete-Time Approximation
FM '08 Proceedings of the 15th international symposium on Formal Methods
A theory of sampling for continuous-time metric temporal logic
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
The basic modal operator bounded until of Metric Temporal Logic (MTL) comes in several variants. In particular it can be strict (when it does not constrain the current instant) or not, and matching (when it requires its two arguments to eventually hold together) or not. This paper compares the relative expressiveness of the resulting MTL variants over dense time. We prove that the expressiveness is not affected by the variations when considering non-Zeno interpretations and arbitrary nesting of temporal operators. On the contrary, the expressiveness changes for flat (i.e., without nesting) formulas, or when Zeno interpretations are allowed.