On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality and Deterministic Freezing
Paritosh K. Pandya, Simoni S. Shah

TL;DR
This paper compares the expressive powers of various timed logics, establishing strict inclusions and incomparabilities, and extends foundational results on the expressiveness of timed temporal logics and freeze logics.
Contribution
It introduces MTL Ehrenfeucht-Fraisse games, proves strict containment of MTL[U,S] within TPTL[U,S], and relates deterministic freeze logic TTL[X,Y] to MITL[F,P], clarifying their expressive boundaries.
Findings
MTL[U,S] is strictly contained in TPTL[U,S].
Certain fragments like BoundedMTL, MTL[F,P], and MITL[U,S] are pairwise incomparable.
TTL[X,Y] is strictly within MITL[F,P], linking deterministic freezing to non-punctual logic.
Abstract
Timed temporal logics exhibit a bewildering diversity of operators and the resulting decidability and expressiveness properties also vary considerably. We study the expressive power of timed logics TPTL[U,S] and MTL[U,S] as well as of their several fragments. Extending the LTL EF games of Etessami and Wilke, we define MTL Ehrenfeucht-Fraisse games on a pair of timed words. Using the associated EF theorem, we show that, expressively, the timed logics BoundedMTL[U,S], MTL[F,P] and MITL[U,S] (respectively incorporating the restrictions of boundedness, unary modalities and non-punctuality), are all pairwise incomparable. As our first main result, we show that MTL[U,S] is strictly contained within the freeze logic TPTL[U,S] for both weakly and strictly monotonic timed words, thereby extending the result of Bouyer et al and completing the proof of the original conjecture of Alur and Henziger…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Logic, Reasoning, and Knowledge · Logic, programming, and type systems
