用于CTL和ECTL的基于上下文的单通道表系统

Time Pub Date : 2020-01-01 DOI:10.4230/LIPIcs.TIME.2020.14
Alex Abuin, A. Bolotov, Montserrat Hermo, P. Lucio
{"title":"用于CTL和ECTL的基于上下文的单通道表系统","authors":"Alex Abuin, A. Bolotov, Montserrat Hermo, P. Lucio","doi":"10.4230/LIPIcs.TIME.2020.14","DOIUrl":null,"url":null,"abstract":"When building tableau for temporal logic formulae, applying a two-pass construction, we first check the validity of the given tableaux input by creating a tableau graph, and then, in the second `pass', we check if all the eventualities are satisfied. In one-pass tableaux checking the validity of the input does not require these auxiliary constructions. This paper continues the development of one-pass tableau method for temporal logics introducing tree-style one-pass tableau systems for Computation Tree Logic (CTL) and shows how this can be extended to capture Extended CTL (ECTL). A distinctive feature here is the utilisation, for the core tableau construction, of the concept of a context of an eventuality which forces its earliest fulfilment. Relevant algorithms for obtaining a systematic tableau for these branching-time logics are also defined. We prove the soundness and completeness of the method. With these developments of a tree-shaped one-pass tableau for CTL and ECTL, we have formalisms which are well suited for the automation and are amenable for the implementation, and for the formulation of dual sequent calculi. This brings us one step closer to the application of one pass context based tableaux in certified model checking for a variety of CTL-type branching-time logics.","PeriodicalId":75226,"journal":{"name":"Time","volume":"16 1","pages":"14:1-14:20"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"One-Pass Context-Based Tableaux Systems for CTL and ECTL\",\"authors\":\"Alex Abuin, A. Bolotov, Montserrat Hermo, P. Lucio\",\"doi\":\"10.4230/LIPIcs.TIME.2020.14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When building tableau for temporal logic formulae, applying a two-pass construction, we first check the validity of the given tableaux input by creating a tableau graph, and then, in the second `pass', we check if all the eventualities are satisfied. In one-pass tableaux checking the validity of the input does not require these auxiliary constructions. This paper continues the development of one-pass tableau method for temporal logics introducing tree-style one-pass tableau systems for Computation Tree Logic (CTL) and shows how this can be extended to capture Extended CTL (ECTL). A distinctive feature here is the utilisation, for the core tableau construction, of the concept of a context of an eventuality which forces its earliest fulfilment. Relevant algorithms for obtaining a systematic tableau for these branching-time logics are also defined. We prove the soundness and completeness of the method. With these developments of a tree-shaped one-pass tableau for CTL and ECTL, we have formalisms which are well suited for the automation and are amenable for the implementation, and for the formulation of dual sequent calculi. This brings us one step closer to the application of one pass context based tableaux in certified model checking for a variety of CTL-type branching-time logics.\",\"PeriodicalId\":75226,\"journal\":{\"name\":\"Time\",\"volume\":\"16 1\",\"pages\":\"14:1-14:20\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Time\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4230/LIPIcs.TIME.2020.14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Time","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/LIPIcs.TIME.2020.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

当为时间逻辑公式构建表格时,应用两步构造,我们首先通过创建表格图来检查给定表格输入的有效性,然后,在第二次“通过”中,我们检查是否满足所有的可能性。在单遍表格中,检查输入的有效性不需要这些辅助结构。本文继续发展时序逻辑的一遍表法,介绍了计算树逻辑(CTL)的树式一遍表系统,并展示了如何扩展到捕获扩展CTL (ECTL)。这里的一个显著特点是利用了核心画面结构的概念,即一种可能性的背景,迫使其最早实现。本文还定义了获得这些分支时间逻辑的系统表的相关算法。证明了该方法的正确性和完备性。随着CTL和ECTL的树形单遍表的这些发展,我们有了非常适合自动化的形式化,并且适合于实现,以及对偶序列演算的制定。这使我们更接近于在各种ctl类型分支时间逻辑的认证模型检查中应用一次通过基于上下文的表。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
One-Pass Context-Based Tableaux Systems for CTL and ECTL
When building tableau for temporal logic formulae, applying a two-pass construction, we first check the validity of the given tableaux input by creating a tableau graph, and then, in the second `pass', we check if all the eventualities are satisfied. In one-pass tableaux checking the validity of the input does not require these auxiliary constructions. This paper continues the development of one-pass tableau method for temporal logics introducing tree-style one-pass tableau systems for Computation Tree Logic (CTL) and shows how this can be extended to capture Extended CTL (ECTL). A distinctive feature here is the utilisation, for the core tableau construction, of the concept of a context of an eventuality which forces its earliest fulfilment. Relevant algorithms for obtaining a systematic tableau for these branching-time logics are also defined. We prove the soundness and completeness of the method. With these developments of a tree-shaped one-pass tableau for CTL and ECTL, we have formalisms which are well suited for the automation and are amenable for the implementation, and for the formulation of dual sequent calculi. This brings us one step closer to the application of one pass context based tableaux in certified model checking for a variety of CTL-type branching-time logics.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信