{"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}
引用次数: 6
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.