{"title":"未来的力量完善于程序逻辑","authors":"Matthew Hennessy, Colin Stirling","doi":"10.1016/S0019-9958(85)80025-5","DOIUrl":null,"url":null,"abstract":"<div><p>The expressiveness of branching time tense (temporal) logics whose eventually operators are relativised to general paths into the future is investigated. These logics are interpreted in models obtained by generalising the usual notion of transition system to allow infinite transitions. It is shown that the presence of formulae expressing the future perfect enables one to prove that the expressiveness of the logic can be characterised by a notion of bisimulation on the generalised transition systems. The future perfect is obtained by adding a past tense operator to the language. Finally the power of various tense languages from the literature are investigated in this framework.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"67 1","pages":"Pages 23-52"},"PeriodicalIF":0.0000,"publicationDate":"1985-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80025-5","citationCount":"137","resultStr":"{\"title\":\"The power of the future perfect in program logics\",\"authors\":\"Matthew Hennessy, Colin Stirling\",\"doi\":\"10.1016/S0019-9958(85)80025-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The expressiveness of branching time tense (temporal) logics whose eventually operators are relativised to general paths into the future is investigated. These logics are interpreted in models obtained by generalising the usual notion of transition system to allow infinite transitions. It is shown that the presence of formulae expressing the future perfect enables one to prove that the expressiveness of the logic can be characterised by a notion of bisimulation on the generalised transition systems. The future perfect is obtained by adding a past tense operator to the language. Finally the power of various tense languages from the literature are investigated in this framework.</p></div>\",\"PeriodicalId\":38164,\"journal\":{\"name\":\"信息与控制\",\"volume\":\"67 1\",\"pages\":\"Pages 23-52\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1985-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80025-5\",\"citationCount\":\"137\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息与控制\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0019995885800255\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995885800255","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
The expressiveness of branching time tense (temporal) logics whose eventually operators are relativised to general paths into the future is investigated. These logics are interpreted in models obtained by generalising the usual notion of transition system to allow infinite transitions. It is shown that the presence of formulae expressing the future perfect enables one to prove that the expressiveness of the logic can be characterised by a notion of bisimulation on the generalised transition systems. The future perfect is obtained by adding a past tense operator to the language. Finally the power of various tense languages from the literature are investigated in this framework.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
