{"doi":"10.1109/SFCS.1989.63473","language":[{"iso":"eng"}],"title":"A really temporal logic","conference":{"name":"FOCS: Foundations of Computer Science","start_date":"1989-10-30","location":"Research Triangle Park, NC, USA","end_date":"1989-11-01"},"article_processing_charge":"No","day":"01","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","author":[{"first_name":"Rajeev","full_name":"Alur, Rajeev","last_name":"Alur"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","series_title":"FCOS","publisher":"IEEE","month":"01","publication_identifier":{"isbn":["0-8186-1982-1"],"eissn":["1558-0814"],"issn":["0018-9162"]},"page":"164 - 169","date_created":"2018-12-11T12:09:40Z","abstract":[{"text":"A real-time temporal logic for the specification of reactive systems is introduced. The novel feature of the logic, TPTL, is the adoption of temporal operators as quantifiers over time variables; every modality binds a variable to the time(s) it refers to. TPTL is demonstrated to be both a natural specification language and a suitable formalism for verification and synthesis. A tableau-based decision procedure and model-checking algorithm for TPTL are presented. Several generalizations of TPTL are shown to be highly undecidable.","lang":"eng"}],"_id":"4596","date_published":"1989-01-01T00:00:00Z","citation":{"short":"R. Alur, T.A. Henzinger, in:, 30th Annual Symposium on Foundations of Computer Science, IEEE, 1989, pp. 164–169.","mla":"Alur, Rajeev, and Thomas A. Henzinger. “A Really Temporal Logic.” <i>30th Annual Symposium on Foundations of Computer Science</i>, IEEE, 1989, pp. 164–69, doi:<a href=\"https://doi.org/10.1109/SFCS.1989.63473\">10.1109/SFCS.1989.63473</a>.","ieee":"R. Alur and T. A. Henzinger, “A really temporal logic,” in <i>30th Annual Symposium on Foundations of Computer Science</i>, Research Triangle Park, NC, USA, 1989, pp. 164–169.","chicago":"Alur, Rajeev, and Thomas A Henzinger. “A Really Temporal Logic.” In <i>30th Annual Symposium on Foundations of Computer Science</i>, 164–69. FCOS. IEEE, 1989. <a href=\"https://doi.org/10.1109/SFCS.1989.63473\">https://doi.org/10.1109/SFCS.1989.63473</a>.","ista":"Alur R, Henzinger TA. 1989. A really temporal logic. 30th Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer ScienceFCOS, 164–169.","ama":"Alur R, Henzinger TA. A really temporal logic. In: <i>30th Annual Symposium on Foundations of Computer Science</i>. FCOS. IEEE; 1989:164-169. doi:<a href=\"https://doi.org/10.1109/SFCS.1989.63473\">10.1109/SFCS.1989.63473</a>","apa":"Alur, R., &#38; Henzinger, T. A. (1989). A really temporal logic. In <i>30th Annual Symposium on Foundations of Computer Science</i> (pp. 164–169). Research Triangle Park, NC, USA: IEEE. <a href=\"https://doi.org/10.1109/SFCS.1989.63473\">https://doi.org/10.1109/SFCS.1989.63473</a>"},"main_file_link":[{"url":"https://ieeexplore.ieee.org/document/63473"}],"publist_id":"111","type":"conference","publication":"30th Annual Symposium on Foundations of Computer Science","extern":"1","year":"1989","acknowledgement":"We thank Zohar Manna, Amir Pnueli, and David Dill for their guidance. Moshe Vardi and Joe Halpern gave us very helpful advice for refilling our undecidability results. ","status":"public","publication_status":"published","date_updated":"2022-02-09T10:40:13Z","oa_version":"None"}