arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1102.5638cs.LO
收藏

论时间逻辑的表达能力:有界性、非准时性和确定性冻结的比较

On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality and Deterministic Freezing

Paritosh K. Pandya, Simoni S. Shah

摘要:

时间时态逻辑表现出令人困惑的多样性的运营商和由此产生的可判定性和表达性属性也有很大的不同。我们研究了时间逻辑TPTL[U,S]和MTL[U,S]以及它们的几个片段的表达能力。扩展Etessami和Wilke的LTL EF游戏,我们定义了MTL Escherichfeucht-Fraisse游戏上的一对定时词。利用相关的EF定理,我们证明了时间逻辑BoundedMTL[U,S],MTL[F,P]和MITL[U,S](分别包含有界性,一元模态和非准时性的限制)都是两两不可比的.作为我们的第一个主要结果,我们证明了MTL[U,S]严格包含在冻结逻辑TPTL[U,S]中,从而推广了Bouyer等人的结果,并完成了1990年Baur和Henziger猜想的证明.我们还涉及到最近提出的确定性冻结逻辑TTL[X,Y](NP完全可满足性)MTL的表现力。作为我们的第二个主要结果,我们通过一个显式的约简证明了TTL[X,Y]严格地位于一元非准时逻辑MITL[F,P]内。这表明,具有准时性的确定性冻结在非准时MITL[F,P]中是可表达的。

英文摘要:

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 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[F,P]. This shows that deterministic freezing with punctuality is expressible in the non-punctual MITL[F,P].

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑