{"doi":"10.1007/BFb0014712","page":"48 - 62","publication":"Proceedings of the 5th International Workshop on Hybrid and Real-Time Systems","author":[{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}],"publication_identifier":{"isbn":["9783540626008"]},"citation":{"apa":"Henzinger, T. A., &#38; Kupferman, O. (1997). From quantity to quality. In <i>Proceedings of the 5th International Workshop on Hybrid and Real-Time Systems</i> (Vol. 1201, pp. 48–62). Grenoble, France: Springer. <a href=\"https://doi.org/10.1007/BFb0014712\">https://doi.org/10.1007/BFb0014712</a>","ista":"Henzinger TA, Kupferman O. 1997. From quantity to quality. Proceedings of the 5th International Workshop on Hybrid and Real-Time Systems. HART: Hybrid and Real-Time Systems, LNCS, vol. 1201, 48–62.","chicago":"Henzinger, Thomas A, and Orna Kupferman. “From Quantity to Quality.” In <i>Proceedings of the 5th International Workshop on Hybrid and Real-Time Systems</i>, 1201:48–62. Springer, 1997. <a href=\"https://doi.org/10.1007/BFb0014712\">https://doi.org/10.1007/BFb0014712</a>.","ama":"Henzinger TA, Kupferman O. From quantity to quality. In: <i>Proceedings of the 5th International Workshop on Hybrid and Real-Time Systems</i>. Vol 1201. Springer; 1997:48-62. doi:<a href=\"https://doi.org/10.1007/BFb0014712\">10.1007/BFb0014712</a>","short":"T.A. Henzinger, O. Kupferman, in:, Proceedings of the 5th International Workshop on Hybrid and Real-Time Systems, Springer, 1997, pp. 48–62.","mla":"Henzinger, Thomas A., and Orna Kupferman. “From Quantity to Quality.” <i>Proceedings of the 5th International Workshop on Hybrid and Real-Time Systems</i>, vol. 1201, Springer, 1997, pp. 48–62, doi:<a href=\"https://doi.org/10.1007/BFb0014712\">10.1007/BFb0014712</a>.","ieee":"T. A. Henzinger and O. Kupferman, “From quantity to quality,” in <i>Proceedings of the 5th International Workshop on Hybrid and Real-Time Systems</i>, Grenoble, France, 1997, vol. 1201, pp. 48–62."},"conference":{"name":"HART: Hybrid and Real-Time Systems","start_date":"1997-03-26","location":"Grenoble, France","end_date":"1997-03-28"},"language":[{"iso":"eng"}],"_id":"4438","volume":1201,"publist_id":"291","intvolume":"      1201","year":"1997","acknowledgement":"This research was supported in part by the ONR YIP award N00014-95-1-0520, by the NSF CAREER award CCR-9501708, by the NSF grant CCR-9504469, by the AFOSR contract F49620-93-1-0056, by the ARO MURI grant DAAH-04-96-1-0341, by the ARPA grant NAG2-892, and by the SRC contract 95-DC-324.036.","day":"01","type":"conference","date_updated":"2022-08-17T12:29:48Z","month":"01","article_processing_charge":"No","publication_status":"published","extern":"1","date_published":"1997-01-01T00:00:00Z","abstract":[{"lang":"eng","text":"In temporal-logic model checking, we verify the correctness of a program with respect to a desired behavior by checking whether a structure that models the program satisfies a temporal-logic formula that specifies the behavior. The model-checking problem for the branching-time temporal logic CTL can be solved in linear running time, and model-checking tools for CTL are used successfully in industrial applications. The development of programs that must meet rigid real-time constraints has brought with it a need for real-time temporal logics that enable quantitative reference to time. Early research on real-time temporal logics uses the discrete domain of the integers to model time. Present research on real-time temporal logics focuses on continuous time and uses the dense domain of the reals to model time. There, model checking becomes significantly more complicated. For example, the model-checking problem for TCTL, a continuous-time extension of the logic CTL, is PSPACE-complete.\r\nIn this paper we suggest a reduction from TCTL model checking to CTL model checking. The contribution of such a reduction is twofold. Theoretically, while it has long been known that model-checking methods for untimed temporal logics can be extended quite easily to handle discrete time, it was not clear whether and how untimed methods can handle the reset quantifier of TCTL, which resets a realvalued clock. Practically, our reduction enables anyone who has a tool for CTL model checking to use it for TCTL model checking. The TCTL model-checking algorithm that follows from our reduction is in PSPACE, matching the known bound for this problem. In addition, it enjoys the wide distribution of CTL model-checking tools and the extensive and fruitful research efforts and heuristics that have been put into these tools."}],"date_created":"2018-12-11T12:08:51Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","scopus_import":"1","publisher":"Springer","status":"public","quality_controlled":"1","title":"From quantity to quality","alternative_title":["LNCS"]}