关于定时CTL认知扩展模型检验问题可判定性的正负结果

C. Dima
{"title":"关于定时CTL认知扩展模型检验问题可判定性的正负结果","authors":"C. Dima","doi":"10.1109/TIME.2009.21","DOIUrl":null,"url":null,"abstract":"We present TCTLK, a continuous-time variant of the Computational Tree Logic with knowledge operators, generalizing both TCTL, the continuous-time variant of CTL, and CTLK, the epistemic generalization of CTL.Formulas are interpreted over timed automata, with a synchronous and perfect recall semantics,and the observability relation requires one to specify what clocks are visible for an agent.We show that, in general, the model-checking problem for TCTLK is undecidable, even if formulas do not use any clocks --and hence CTLK has an undecidable model-checking problem when interpreted over timed automata.On the other hand, we show that, when each agent can see all clock values,model-checking becomes decidable.","PeriodicalId":163298,"journal":{"name":"2009 16th International Symposium on Temporal Representation and Reasoning","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Positive and Negative Results on the Decidability of the Model-Checking Problem for an Epistemic Extension of Timed CTL\",\"authors\":\"C. Dima\",\"doi\":\"10.1109/TIME.2009.21\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present TCTLK, a continuous-time variant of the Computational Tree Logic with knowledge operators, generalizing both TCTL, the continuous-time variant of CTL, and CTLK, the epistemic generalization of CTL.Formulas are interpreted over timed automata, with a synchronous and perfect recall semantics,and the observability relation requires one to specify what clocks are visible for an agent.We show that, in general, the model-checking problem for TCTLK is undecidable, even if formulas do not use any clocks --and hence CTLK has an undecidable model-checking problem when interpreted over timed automata.On the other hand, we show that, when each agent can see all clock values,model-checking becomes decidable.\",\"PeriodicalId\":163298,\"journal\":{\"name\":\"2009 16th International Symposium on Temporal Representation and Reasoning\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-07-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 16th International Symposium on Temporal Representation and Reasoning\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TIME.2009.21\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 16th International Symposium on Temporal Representation and Reasoning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TIME.2009.21","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

我们提出了TCTLK,一个带知识算子的计算树逻辑的连续时间变体,它推广了TCTL的连续时间变体和CTLK的认知推广。公式是在时间自动机上解释的,具有同步和完美的召回语义,并且可观察性关系要求指定代理可以看到哪些时钟。我们表明,在一般情况下,TCTLK的模型检查问题是不可确定的,即使公式不使用任何时钟——因此,当在时间自动机上解释时,CTLK具有不可确定的模型检查问题。另一方面,我们表明,当每个代理都可以看到所有时钟值时,模型检查变得可确定。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Positive and Negative Results on the Decidability of the Model-Checking Problem for an Epistemic Extension of Timed CTL
We present TCTLK, a continuous-time variant of the Computational Tree Logic with knowledge operators, generalizing both TCTL, the continuous-time variant of CTL, and CTLK, the epistemic generalization of CTL.Formulas are interpreted over timed automata, with a synchronous and perfect recall semantics,and the observability relation requires one to specify what clocks are visible for an agent.We show that, in general, the model-checking problem for TCTLK is undecidable, even if formulas do not use any clocks --and hence CTLK has an undecidable model-checking problem when interpreted over timed automata.On the other hand, we show that, when each agent can see all clock values,model-checking becomes decidable.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信