{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:58:08Z","timestamp":1776333488610,"version":"3.51.2"},"reference-count":23,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5311,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0304-3975(97)00173-4","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"253-273","source":"Crossref","is-referenced-by-count":144,"title":["Event-clock automata: a determinizable class of timed automata"],"prefix":"10.1016","volume":"211","author":[{"given":"Rajeev","family":"Alur","sequence":"first","affiliation":[]},{"given":"Limor","family":"Fix","sequence":"additional","affiliation":[]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00173-4_BIB1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/inco.1993.1024","article-title":"Model checking in dense real time","volume":"104","author":"Alur","year":"1993","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(97)00173-4_BIB2","series-title":"Proc. 5th Annual Conf. on Computer-Aided Verification","first-page":"181","article-title":"Computing accumulated delays in real-time systems","volume":"vol. 697","author":"Alur","year":"1993"},{"key":"10.1016\/S0304-3975(97)00173-4_BIB3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","article-title":"A theory of timed automata","volume":"126","author":"Alur","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00173-4_BIB4","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/227595.227602","article-title":"The benefits of relaxing punctuality","volume":"43","author":"Alur","year":"1996","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(97)00173-4_BIB5","series-title":"Proc. 33rd Annual Symp. on Foundations of Computer Science, IEEE Computer Society Press","first-page":"177","article-title":"Back to the future: towards a theory of timed regular languages","author":"Alur","year":"1992"},{"issue":"1","key":"10.1016\/S0304-3975(97)00173-4_BIB6","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1006\/inco.1995.1059","article-title":"Timing verification by successive approximation","volume":"118","author":"Alur","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(97)00173-4_BIB7","series-title":"Hybrid Systems III: Verification and Control","first-page":"220","article-title":"Timing analysis in Cospan","volume":"vol. 1066","author":"Alur","year":"1996"},{"key":"10.1016\/S0304-3975(97)00173-4_BIB8","series-title":"Hybrid Systems III: Verification and Control","first-page":"232","article-title":"UPPAAL: a tool suite for automatic verification of real-time systems","volume":"vol. 1066","author":"Bengtsson","year":"1996"},{"key":"10.1016\/S0304-3975(97)00173-4_BIB9","series-title":"Proc. 3rd Annual Conf. on Computer-Aided Verification","first-page":"399","article-title":"Minimum and maximum delay problems in real-time systems","volume":"vol. 575","author":"Courcoubetis","year":"1991"},{"key":"10.1016\/S0304-3975(97)00173-4_BIB10","series-title":"Hybrid Systems III: Verification and Control","first-page":"208","article-title":"The tool Kronos","volume":"vol. 1066","author":"Daws","year":"1996"},{"key":"10.1016\/S0304-3975(97)00173-4_BIB11","series-title":"Proc. 1st Annual Conf. on Computer-Aided Verification","first-page":"197","article-title":"Timing assumptions and verification of finite-state concurrent systems","volume":"vol. 407","author":"Dill","year":"1989"},{"key":"10.1016\/S0304-3975(97)00173-4_BIB12","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1006\/inco.1994.1060","article-title":"Temporal proof methodologies for timed transition systems","volume":"112","author":"Henzinger","year":"1994","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(97)00173-4_BIB13","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1006\/inco.1994.1045","article-title":"Symbolic model checking for real-time systems","volume":"111","author":"Henzinger","year":"1994","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(97)00173-4_BIB14","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(97)00173-4_BIB15","series-title":"Computer-Aided Verification: The Automata-Theoretic Approach","author":"Kurshan","year":"1994"},{"key":"10.1016\/S0304-3975(97)00173-4_BIB16","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02252683","article-title":"Using mappings to prove timing properties","volume":"6","author":"Lynch","year":"1992","journal-title":"Distrib. Comput."},{"key":"10.1016\/S0304-3975(97)00173-4_BIB17","series-title":"The Temporal Logic of Reactive and Concurrent Systems","author":"Manna","year":"1991"},{"key":"10.1016\/S0304-3975(97)00173-4_BIB18","series-title":"Proc. 2nd Annual Conf. on Concurrency Theory","first-page":"408","article-title":"Time-constrained automata","volume":"vol. 527","author":"Merritt","year":"1991"},{"key":"10.1016\/S0304-3975(97)00173-4_BIB19","series-title":"Real Time: Theory in Practice","first-page":"618","article-title":"Putting time into proof outlines","volume":"vol. 600","author":"Schneider","year":"1991"},{"key":"10.1016\/S0304-3975(97)00173-4_BIB20","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(87)90008-9","article-title":"The complementation problem for B\u00fcchi automata with applications to temporal logic","volume":"49","author":"Sistla","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00173-4_BIB21","series-title":"Proc. 24th Annual Symp. on Foundations of Computer Science, IEEE Computer Society Press","first-page":"185","article-title":"Reasoning about infinite computation paths","author":"Wolper","year":"1983"},{"key":"10.1016\/S0304-3975(97)00173-4_BIB22","series-title":"Proc. 5th Annual Conf. on Computer-Aided Verification","first-page":"210","article-title":"An efficient algorithm for minimizing real-time transition systems","volume":"vol. 697","author":"Yannakakis","year":"1993"},{"key":"10.1016\/S0304-3975(97)00173-4_BIB23","series-title":"Proc. 5th Annual Conf. on Computer-Aided Verification","first-page":"321","article-title":"Efficient verification of parallel real-time systems","volume":"vol. 697","author":"Yoneda","year":"1993"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001734?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001734?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:27:12Z","timestamp":1556522832000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597001734"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0304397597001734"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00173-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}