{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:21:34Z","timestamp":1775053294305,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540558224","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0084802","type":"book-chapter","created":{"date-parts":[[2006,11,24]],"date-time":"2006-11-24T13:12:14Z","timestamp":1164373934000},"page":"340-354","source":"Crossref","is-referenced-by-count":69,"title":["Minimization of timed transition systems"],"prefix":"10.1007","author":[{"given":"R.","family":"Alur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Courcoubetis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Halbwachs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Dill","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Wong-Toi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"R. Alur, C. Courcoubetis, and D. Dill. Model-checking for real-time systems. In Proceedings of the Fifth IEEE Symposium on Logic in Computer Science, pages 414\u2013425, 1990.","DOI":"10.1109\/LICS.1990.113766"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"R. Alur and D. Dill. Automata for modeling real-time systems. In Automata, Languages and Programming: Proceedings of the 17th ICALP, Lecture Notes in Computer Science 443, pages 322\u2013335. Springer-Verlag, 1990.","DOI":"10.1007\/BFb0032042"},{"key":"25_CR3","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":"25_CR4","doi-asserted-by":"crossref","unstructured":"R. Alur and T. Henzinger. A really temporal logic. In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, pages 164\u2013169, 1989. Journal version to appear in the Journal of the ACM.","DOI":"10.1109\/SFCS.1989.63473"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"A. Bouajjani, J. Fernandez, and N. Halbwachs. Minimal model generation. In Proceedings of the Second Workshop on Computer-Aided Verification, Rutgers University, 1990.","DOI":"10.1090\/dimacs\/003\/08"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"A. Bouajjani, J. Fernandez, N. Halbwachs, P. Raymond, and C. Ratel. Minimal state graph generation. Science of Computer Programming, 1992. To appear.","DOI":"10.1016\/0167-6423(92)90018-7"},{"issue":"12","key":"25_CR7","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1109\/TC.1986.1676711","volume":"C-35","author":"M. Browne","year":"1986","unstructured":"M. Browne, E. Clarke, D. Dill, and B. Mishra. Automatic verification of sequential circuits using temporal logic. IEEE Transactions on Computers, C-35(12):1035\u20131044, 1986.","journal-title":"IEEE Transactions on Computers"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"J. Burch, E. Clarke, D. Dill, L. Hwang, and K. L. McMillan. Symbolic model checking: 1020 states and beyond. In Proceedings of the Fifth IEEE Symposium on Logic in Computer Science, pages 428\u2013439, 1990.","DOI":"10.1109\/LICS.1990.113767"},{"key":"25_CR9","unstructured":"K. Cerans. Decidability of bisimulation equivalence for parallel timer processes. In Proceedings of Chalmers Workshop on Concurrency, Goteborg, 1991."},{"issue":"2","key":"25_CR10","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E. Clarke","year":"1986","unstructured":"E. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal-logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244\u2013263, 1986.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"25_CR11","volume-title":"Minimum and maximum delay problems in realtime systems","author":"C. Courcoubetis","year":"1991","unstructured":"C. Courcoubetis and M. Yannakakis. Minimum and maximum delay problems in realtime systems. In Proceedings of the Third Workshop on Computer-Aided Verification, Aalborg University, Denmark, 1991."},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"D. Dill. Timing assumptions and verification of finite-state concurrent systems. In J. Sifakis, editor, Automatic Verification Methods for Finite State Systems, Lecture Notes in Computer Science 407. Springer-Verlag, 1989.","DOI":"10.1007\/3-540-52148-8_17"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"E. Emerson and C. Lei. Modalities for model-checking: Branching time logic strikes back. In Proceedings of the 12th ACM Symposium on Principles of Programming Languages, pages 84\u201396, 1985.","DOI":"10.1145\/318593.318620"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0167-6423(83)90017-5","volume":"2","author":"E. A. Emerson","year":"1982","unstructured":"E. A. Emerson and E. M. Clarke. Using branching-time temporal logic to synthesize synchronization skeletons. Science of Computer Programming, 2:241\u2013266, 1982.","journal-title":"Science of Computer Programming"},{"key":"25_CR15","unstructured":"E. A. Emerson, A. Mok, A. P. Sistla, and J. Srinivasan. Quantitative temporal reasoning. Presented at the First Workshop on Computer-aided Verification, Grenoble, France, 1989."},{"key":"25_CR16","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, 1992. To appear."},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"D. Lee and M. Yannakakis. Online minimization of transition systems. In Proceedings of ACM Symposium of Theory of Computing, 1992. To appear.","DOI":"10.1145\/129712.129738"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"H. Lewis. A logic of concrete time intervals. In Proceedings of the Fifth IEEE Symposium on Logic in Computer Science, pages 380\u2013389, 1990.","DOI":"10.1109\/LICS.1990.113763"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"X. Nicollin, J. Sifakis, and S. Yovine. From ATP to timed graphs and hybrid systems. In Proceedings of REX workshop \u201cReal-time: theory in practice\u201d, Lecture Notes in Computer Science 600. Springer-Verlag, 1991.","DOI":"10.1007\/BFb0032007"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"H. Wong-Toi and G. Hoffmann. The control of dense real-time discrete event systems. In Proceedings of the 30th IEEE Conference on Decision and Control, pages 1527\u20131528, 1991.","DOI":"10.21236\/ADA325997"}],"container-title":["Lecture Notes in Computer Science","CONCUR '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0084802.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T03:55:52Z","timestamp":1736654152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0084802"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540558224"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0084802","relation":{},"subject":[]}}