首页> 外文会议>Annual symposium on theoretical aspects of computer science >Expressive Completeness of LTrL on Finite Traces: an Algebraic Proof
【24h】

Expressive Completeness of LTrL on Finite Traces: an Algebraic Proof

机译:LTRL对有限迹线的表现形式:代数证明

获取原文

摘要

Very recently a new temporal logic, for Mazurkiewicz traces, denoted LTrL, has been defined by Thiagarajan and Walukiewicz [15]. They have shown that this logic is equal in expresive power to the first order theory of finite and infiinte traces thus filling a prominent gap in the theory. We proposee in this paper a entirely new, algebraic, proof of this esult in the case of finite traces only. Our proof generalizes conhen, perrin and Pin's work on finite sequences[2], using as a basictool a new extension of the wreath product principle on traces[7]. As a major consequence of our proof we show that, when dealing with finite traces only, no past modality is necessary to obtain a expressively complete logic. precisely,we prove that teh logic LTrL sub red, obtained rom LTrL by not using the past modularity, has the same expresive power as the first order theory on finite traces.
机译:最近,对于Mazurkiewicz迹线,表示LTRL的新的时间逻辑已经由Thiagarajan和Walukiewicz定义[15]。 他们已经表明,这种逻辑与有限和Infiinte迹线的第一阶理论的表现力相同,从而填补了理论中的突出差距。 我们在本文中提出了一个完全新的,代数,在有限迹线的情况下对这一目标的证明。 我们的证据概括了Conhen,Perrin和Pin在有限序列上的工作[2],使用Basictool在迹线上进行了花圈产品原理的新延长[7]。 作为我们证据的主要后果,我们表明,在处理有限迹线时,没有必要的态度来获得表现完全的逻辑。 精确地,我们证明了Teh Ltrl子红色,通过不使用过去的模块化而获得ROM LTRL,具有与有限迹线的第一订单理论相同的表现力。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号