{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T19:14:04Z","timestamp":1773083644622,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540581796","type":"print"},{"value":"9783540484691","type":"electronic"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58179-0_39","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:24:36Z","timestamp":1330269876000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":36,"title":["A determinizable class of timed automata"],"prefix":"10.1007","author":[{"given":"Rajeev","family":"Alur","sequence":"first","affiliation":[]},{"given":"Limor","family":"Fix","sequence":"additional","affiliation":[]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/inco.1993.1024","volume":"104","author":"R. Alur","year":"1993","unstructured":"R. Alur, C. Courcoubetis, and D. Dill. Model-checking in dense real-time. Information and Computation, 104:2\u201334, 1993.","journal-title":"Information and Computation"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"R. Alur, C. Courcoubetis, and T. Henzinger. Computing accumulated delays in real-time systems. In Proceedings of the Fifth Conference on Computer-Aided Verification, Lecture Notes in Computer Science 697, pages 181\u2013193. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-56922-7_16"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"R. Alur and D. Dill. Automata for modeling real-time systems. In Proceedings of the 17th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science 443, pages 322\u2013335. Springer-Verlag, 1990.","DOI":"10.1007\/BFb0032042"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"R. Alur, T. Feder, and T. Henzinger. The benefits of relaxing punctuality. In Proceedings of the Tenth ACM Symposium on Principles of Distributed Computing, pages 139\u2013152, 1991.","DOI":"10.1145\/112600.112613"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"R. Alur and T. Henzinger. Back to the future: Towards a theory of timed regular languages. In Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, pages 177\u2013186, 1992.","DOI":"10.1109\/SFCS.1992.267774"},{"key":"1_CR6","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/3-540-55179-4_37","volume":"575","author":"C. Courcoubetis","year":"1991","unstructured":"C. Courcoubetis and M. Yannakakis. Minimum and maximum delay problems in real-time systems. In Proceedings of the Third Workshop on Computer-Aided Verification, Lecture Notes in Computer Science 575, pages 399\u2013409, 1991.","journal-title":"Proceedings of the Third Workshop on Computer-Aided Verification, Lecture Notes in Computer Science"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"T. Henzinger, Z. Manna, and A. Pnueli. Temporal proof methodologies for realtime systems. In Proceedings of the 18th ACM Symposium on Principles of Programming Languages, pages 353\u2013366, 1991.","DOI":"10.1145\/99583.99629"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model-checking for real-time systems. In Proceedings of the Seventh IEEE Symposium on Logic in Computer Science, pages 394\u2013406, 1992.","DOI":"10.1109\/LICS.1992.185551"},{"key":"1_CR9","unstructured":"J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"R. Kurshan. Reducibility in analysis of coordination. In Lecture Notes in Computer Science, volume 103, pages 19\u201339. Springer-Verlag, 1987.","DOI":"10.1007\/BFb0042302"},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02252683","volume":"6","author":"N. Lynch","year":"1992","unstructured":"N. Lynch and H. Attiya. Using mappings to prove timing properties. Distributed Computing, 6:121\u2013139, 1992.","journal-title":"Distributed Computing"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag, 1991.","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"M. Merritt, F. Modugno, and M. Tuttle. Time-constrained automata. In Proceedings of the Workshop on Theories of Concurrency, Lecture Notes in Computer Science 527, pages 408\u2013423. Springer-Verlag, 1991.","DOI":"10.1007\/3-540-54430-5_103"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"F. Schneider, B. Bloom, and K. Marzullo. Putting time into proof outlines. In Real-Time: Theory in Practice, Lecture Notes in Computer Science 600, pages 618\u2013639. Springer-Verlag, 1991.","DOI":"10.1007\/BFb0032010"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(87)90008-9","volume":"49","author":"A. Sistla","year":"1987","unstructured":"A. Sistla, M. Vardi, and P. Wolper. The complementation problem for B\u00fcchi automata with applications to temporal logic. Theoretical Computer Science, 49:217\u2013237, 1987.","journal-title":"Theoretical Computer Science"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"P. Wolper, M. Vardi, and A. Sistla. Reasoning about infinite computation paths. In Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, pages 185\u2013194, 1983.","DOI":"10.1109\/SFCS.1983.51"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"T. Yoneda, A. Shibayam, B. Schlingloff, and E. Clarke. Efficient verification of parallel real-time systems. In Proceedings of the Fifth Conference on Computer-Aided Verification, Lecture Notes in Computer Science 697, pages 321\u2013332. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-56922-7_27"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58179-0_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:21:14Z","timestamp":1742595674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58179-0_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540581796","9783540484691"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-58179-0_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"7 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}