在时间逻辑内和时间逻辑外

[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1993-06-19 DOI:10.1109/LICS.1993.287594

A. Pnueli, L. Zuck

{"title":"在时间逻辑内和时间逻辑外","authors":"A. Pnueli, L. Zuck","doi":"10.1109/LICS.1993.287594","DOIUrl":null,"url":null,"abstract":"Two-way translations between various versions of temporal logic and between temporal logic over finite sequences and star-free regular expressions are presented. The main result is a translation from normal-form temporal logic formulas to formulas that use only future operators. The translation offers a new proof to a theorem claimed by D. Gabbay et al. (1980), stating that restricting temporal logic to the future operators does not impair its expressive power. The theorem is the basis of many temporal proof systems.<<ETX>>","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"82 1","pages":"124-135"},"PeriodicalIF":0.0000,"publicationDate":"1993-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"In and out of temporal logic\",\"authors\":\"A. Pnueli, L. Zuck\",\"doi\":\"10.1109/LICS.1993.287594\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Two-way translations between various versions of temporal logic and between temporal logic over finite sequences and star-free regular expressions are presented. The main result is a translation from normal-form temporal logic formulas to formulas that use only future operators. The translation offers a new proof to a theorem claimed by D. Gabbay et al. (1980), stating that restricting temporal logic to the future operators does not impair its expressive power. The theorem is the basis of many temporal proof systems.<<ETX>>\",\"PeriodicalId\":6322,\"journal\":{\"name\":\"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science\",\"volume\":\"82 1\",\"pages\":\"124-135\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.1993.287594\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.1993.287594","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 16

摘要

提出了时间逻辑的各种版本之间以及有限序列上的时间逻辑与无星型正则表达式之间的双向转换。主要的结果是从标准形式的时间逻辑公式到只使用将来运算符的公式的转换。这一翻译为D. Gabbay等人(1980)提出的一个定理提供了新的证明，该定理指出，将时间逻辑限制为未来运算符并不会损害其表达能力。这个定理是许多时间证明系统的基础。

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

查看原文本刊更多论文

In and out of temporal logic

Two-way translations between various versions of temporal logic and between temporal logic over finite sequences and star-free regular expressions are presented. The main result is a translation from normal-form temporal logic formulas to formulas that use only future operators. The translation offers a new proof to a theorem claimed by D. Gabbay et al. (1980), stating that restricting temporal logic to the future operators does not impair its expressive power. The theorem is the basis of many temporal proof systems.<>

求助全文

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

来源期刊

[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science

自引率

0.00%

发文量