[{"article_processing_charge":"No","alternative_title":["LNCS"],"volume":1466,"doi":"10.1007/BFb0055640","conference":{"name":"CONCUR: Concurrency Theory","location":"Nice, France","start_date":"1998-09-08","end_date":"1998-09-11"},"publication_identifier":{"isbn":["978-3-540-64896-3"]},"page":"439 - 454","day":"01","fulldoi":"https://doi.org/10.1007/BFb0055640","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","title":"It's about time: Real-time logics reviewed","_id":"4515","date_published":"1998-01-01T00:00:00Z","month":"01","extern":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","citation":{"ieee":"T. A. Henzinger, “It’s about time: Real-time logics reviewed,” in <i>Proceedings of the 9th Interantional Conference on Concurrency Theory</i>, Nice, France, 1998, vol. 1466, pp. 439–454.","ista":"Henzinger TA. 1998. It’s about time: Real-time logics reviewed. Proceedings of the 9th Interantional Conference on Concurrency Theory. CONCUR: Concurrency Theory, LNCS, vol. 1466, 439–454.","ama":"Henzinger TA. It’s about time: Real-time logics reviewed. In: <i>Proceedings of the 9th Interantional Conference on Concurrency Theory</i>. Vol 1466. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 1998:439-454. doi:<a href=\"https://doi.org/10.1007/BFb0055640\">10.1007/BFb0055640</a>","chicago":"Henzinger, Thomas A. “It’s about Time: Real-Time Logics Reviewed.” In <i>Proceedings of the 9th Interantional Conference on Concurrency Theory</i>, 1466:439–54. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998. <a href=\"https://doi.org/10.1007/BFb0055640\">https://doi.org/10.1007/BFb0055640</a>.","mla":"Henzinger, Thomas A. “It’s about Time: Real-Time Logics Reviewed.” <i>Proceedings of the 9th Interantional Conference on Concurrency Theory</i>, vol. 1466, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998, pp. 439–54, doi:<a href=\"https://doi.org/10.1007/BFb0055640\">10.1007/BFb0055640</a>.","apa":"Henzinger, T. A. (1998). It’s about time: Real-time logics reviewed. In <i>Proceedings of the 9th Interantional Conference on Concurrency Theory</i> (Vol. 1466, pp. 439–454). Nice, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/BFb0055640\">https://doi.org/10.1007/BFb0055640</a>","short":"T.A. Henzinger, in:, Proceedings of the 9th Interantional Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998, pp. 439–454."},"oa_version":"None","year":"1998","publication":"Proceedings of the 9th Interantional Conference on Concurrency Theory","date_created":"2018-12-11T12:09:15Z","publication_status":"published","acknowledgement":"This research was supported in part by the Office of Naval Research Young Investigator award N00014-95-1-0520, by the National Science Foundation CAREER award CCR-9501708, by the National Science Foundation grant CCR-9504469, by the Defense Advanced Research Projects Agency grant NAG2-1214, by the Army Research Office MURI grant DAAH-04-96-1-0341, and by the Semiconductor Research Corporation contract 97-DC-324.041.","intvolume":"      1466","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"}],"date_updated":"2022-08-23T14:24:08Z","publist_id":"214","scopus_import":"1","quality_controlled":"1","status":"public","abstract":[{"text":"We summarize and reorganize some of the last decade's research on real-time extensions of temporal logic. Our main focus is on tableau constructions for model checking linear temporal formulas with timing constraints. In particular, we find that a great deal of real-time verification can be performed in polynomial space, but also that considerable care must be exercised in order to keep the real-time verification problem in polynomial space, or even decidable.","lang":"eng"}],"language":[{"iso":"eng"}],"type":"conference"}]
