On expressive powers of timed logics: comparing boundedness, non-punctuality, and deterministic freezing

• Authors: Paritosh K. Pandya;Simoni S. Shah
• Venue: CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
• Year: 2011

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[UI, SI] as well as of their several fragments. Extending the LTL EF games of Etessami and Wilke, we define MTL Ehrenfeucht-Fraïssé games on a pair of timed words. Using the associated EF theorem, we show that, expressively, the timed logics BoundedMTL[UI, SI], MTL[FI, PI] and MITL[UI, SI] (respectively incorporating the restrictions of boundedness, unary modalities and non-punctuality), are all pairwise incomparable. As our first main result, we show that MTL[UI, SI] 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 from 1990. We also relate the expressiveness of a recently proposed deterministic freeze logic TTL[Xθ, Yθ] (with NP-complete satisfiability) to MTL. As our second main result, we show by an explicit reduction that TTL[Xθ, Yθ] lies strictly within the unary, non-punctual logic MITL[FI, PI]. This shows that deterministic freezing with punctuality is expressible in the non-punctual MITL[FI, PI].