Why so many temporal logics climb up the trees.pdfVIP

下载本文档

3
0
约3.04万字
约 11页
2017-04-05 发布于江苏
举报
版权申诉

Why so many temporal logics climb up the trees.pdf

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Why so many temporal logics climb up the trees

Why so many Temporal Logics Climb up the Trees?Alexander Rabinovich and Shahar MaozSchool of Mathematical ScienceTel Aviv UniversityTel Aviv, Israel 69978frabino, maozg@math.tau.ac.ilAbstract. Many temporal logics were suggested as branching time spec-ication formalisms during the last 20 years. These logics were comparedagainst each other for their expressive power, model checking complexityand succinctness. Yet, unlike the case for linear time logics, no canonicaltemporal logic of branching time was agreed upon. We oer an expla-nation for the multiplicity of temporal logics over branching time andprovide an objective quantied `yardstick to measure these logics.We dene an innite hierarchy BTLk of temporal logics and prove itsstrictness. We show that CTL has no nite base, and that almost allof its many sub-logics suggested in the literature are inside the secondlevel of our hierarchy. We show that for every logic based on a nite setof modalities, the complexity of model checking is linear both in the sizeof structure and the size of formula.1 IntroductionVarious temporal logics have been proposed for reasoning about so-called \re-active systems, computer hardware or software systems which exhibit (poten-tially) non-terminating and non-deterministic behavior. Such a system is typi-cally represented by the (potentially) innite sequences of computation statesthrough which it may evolve, where we associate with each state the set of atomicpropositions which are true in that state, along with the possible next state tran-sitions to which it may evolve. Thus its behavior is denoted by a (potentially)innite rooted tree, with the initial state of the system represented by the rootof the tree.Temporal Logic (TL) is a convenient framework for the specication prop-erties of systems. This made TL a popular subject in the Computer Sciencecommunity and it enjoyed extensive research during the last 20 years. In tem-poral logic the relevant properties of the system are d