{"doi":"10.1145/174644.174651","day":"01","author":[{"full_name":"Alur, Rajeev","first_name":"Rajeev","last_name":"Alur"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","_id":"4591","scopus_import":"1","volume":41,"publication":"Journal of the ACM","page":"181 - 204","citation":{"ieee":"R. Alur and T. A. Henzinger, “A really temporal logic,” <i>Journal of the ACM</i>, vol. 41, no. 1. ACM, pp. 181–204, 1994.","mla":"Alur, Rajeev, and Thomas A. Henzinger. “A Really Temporal Logic.” <i>Journal of the ACM</i>, vol. 41, no. 1, ACM, 1994, pp. 181–204, doi:<a href=\"https://doi.org/10.1145/174644.174651\">10.1145/174644.174651</a>.","ista":"Alur R, Henzinger TA. 1994. A really temporal logic. Journal of the ACM. 41(1), 181–204.","ama":"Alur R, Henzinger TA. A really temporal logic. <i>Journal of the ACM</i>. 1994;41(1):181-204. doi:<a href=\"https://doi.org/10.1145/174644.174651\">10.1145/174644.174651</a>","apa":"Alur, R., &#38; Henzinger, T. A. (1994). A really temporal logic. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/174644.174651\">https://doi.org/10.1145/174644.174651</a>","short":"R. Alur, T.A. Henzinger, Journal of the ACM 41 (1994) 181–204.","chicago":"Alur, Rajeev, and Thomas A Henzinger. “A Really Temporal Logic.” <i>Journal of the ACM</i>. ACM, 1994. <a href=\"https://doi.org/10.1145/174644.174651\">https://doi.org/10.1145/174644.174651</a>."},"status":"public","publist_id":"118","type":"journal_article","intvolume":"        41","title":"A really temporal logic","publisher":"ACM","publication_status":"published","date_updated":"2022-06-02T08:23:46Z","quality_controlled":"1","abstract":[{"lang":"eng","text":"We introduce a temporal logic for the specification of real-time systems. Our logic, TPTL, employs a novel quantifier construct for referencing time: the freeze quantifier binds a variable to the time of the local temporal context. TPTL is both a natural language for specification and a suitable formalism for verification. We present a tableau-based decision procedure and a model-checking algorithm for TPTL. Several generalizations of TPTL are shown to be highly undecidable."}],"extern":"1","date_published":"1994-01-01T00:00:00Z","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:09:38Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","issue":"1","acknowledgement":"We thank Zohar Manna, Amir Pnueli, and David Dill for their guidance. Moshe Vardi and Joe Halpern gave us very helpful advice for refining our undecidability results; in particular, they pointed out to us the completeness of a problem on Turing machines.\r\n","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/174644.174651"}],"year":"1994","oa_version":"None","month":"01","publication_identifier":{"issn":["0004-5411"]},"article_type":"original"}