全混合计算树逻辑的模型检验

2016 23rd International Symposium on Temporal Representation and Reasoning (TIME) Pub Date : 2016-10-01 DOI:10.1109/TIME.2016.11

Daniel Kernberger, M. Lange

{"title":"全混合计算树逻辑的模型检验","authors":"Daniel Kernberger, M. Lange","doi":"10.1109/TIME.2016.11","DOIUrl":null,"url":null,"abstract":"We consider the hybridisations of the full branching time logic CTL* through the addition of nominals, binders and jumps. We formally define three fragments restricting the interplay between hybrid operators and path formulae contrary to previous proposals in the literature which ignored potential problems with a formal semantics. We then investigate the model checking problem for these logics obtaining complexities from PSPACE-completeness to non-elementary decidability.","PeriodicalId":347020,"journal":{"name":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Model Checking for the Full Hybrid Computation Tree Logic\",\"authors\":\"Daniel Kernberger, M. Lange\",\"doi\":\"10.1109/TIME.2016.11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the hybridisations of the full branching time logic CTL* through the addition of nominals, binders and jumps. We formally define three fragments restricting the interplay between hybrid operators and path formulae contrary to previous proposals in the literature which ignored potential problems with a formal semantics. We then investigate the model checking problem for these logics obtaining complexities from PSPACE-completeness to non-elementary decidability.\",\"PeriodicalId\":347020,\"journal\":{\"name\":\"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TIME.2016.11\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TIME.2016.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

我们考虑了全分支时间逻辑CTL*的杂化，通过添加标称、绑定和跳跃。我们正式定义了三个限制混合算子和路径公式之间相互作用的片段，这与先前文献中忽略形式语义潜在问题的建议相反。然后，我们研究了这些逻辑从pspace完备到非初等可判定的复杂性的模型检验问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Model Checking for the Full Hybrid Computation Tree Logic

We consider the hybridisations of the full branching time logic CTL* through the addition of nominals, binders and jumps. We formally define three fragments restricting the interplay between hybrid operators and path formulae contrary to previous proposals in the literature which ignored potential problems with a formal semantics. We then investigate the model checking problem for these logics obtaining complexities from PSPACE-completeness to non-elementary decidability.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)

自引率

0.00%

发文量