{"publication_status":"published","publisher":"ACM","scopus_import":"1","type":"journal_article","citation":{"chicago":"Alur, Rajeev, Tomás Feder, and Thomas A Henzinger. “The Benefits of Relaxing Punctuality.” Journal of the ACM. ACM, 1996. https://doi.org/10.1145/227595.227602.","ieee":"R. Alur, T. Feder, and T. A. Henzinger, “The benefits of relaxing punctuality,” Journal of the ACM, vol. 43, no. 1. ACM, pp. 116–146, 1996.","mla":"Alur, Rajeev, et al. “The Benefits of Relaxing Punctuality.” Journal of the ACM, vol. 43, no. 1, ACM, 1996, pp. 116–46, doi:10.1145/227595.227602.","ista":"Alur R, Feder T, Henzinger TA. 1996. The benefits of relaxing punctuality. Journal of the ACM. 43(1), 116–146.","ama":"Alur R, Feder T, Henzinger TA. The benefits of relaxing punctuality. Journal of the ACM. 1996;43(1):116-146. doi:10.1145/227595.227602","apa":"Alur, R., Feder, T., & Henzinger, T. A. (1996). The benefits of relaxing punctuality. Journal of the ACM. ACM. https://doi.org/10.1145/227595.227602","short":"R. Alur, T. Feder, T.A. Henzinger, Journal of the ACM 43 (1996) 116–146."},"oa_version":"None","issue":"1","title":"The benefits of relaxing punctuality","month":"01","_id":"4610","publication_identifier":{"issn":["0004-5411"]},"doi":"10.1145/227595.227602","article_processing_charge":"No","date_published":"1996-01-01T00:00:00Z","year":"1996","date_created":"2018-12-11T12:09:44Z","publication":"Journal of the ACM","page":"116 - 146","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","author":[{"full_name":"Alur, Rajeev","first_name":"Rajeev","last_name":"Alur"},{"first_name":"Tomás","full_name":"Feder, Tomás","last_name":"Feder"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"}],"publist_id":"95","language":[{"iso":"eng"}],"volume":43,"article_type":"original","quality_controlled":"1","day":"01","abstract":[{"lang":"eng","text":"The most natural, compositional, way of modeling real-time systems uses a dense domain for time. The satisfiability of timing constraints that are capable of expressing punctuality in this model, however, is known to be undecidable. We introduce a temporal language that can constrain the time difference between events only with finite, yet arbitrary, precision and show the resulting logic to be EXPSPACE-complete. This result allows us to develop an algorithm for the verification of timing properties of real-time systems with a dense semantics."}],"status":"public","intvolume":" 43","date_updated":"2022-07-04T12:38:01Z","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/227595.227602"}],"extern":"1","acknowledgement":"We wish to thank an anonymous referee for pointing out the PSPACE-fragment of Section 4.5. "}