{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T13:35:45Z","timestamp":1761917745447},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540418665"},{"type":"electronic","value":"9783540453512"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45351-2_15","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T23:27:49Z","timestamp":1194996469000},"page":"147-161","source":"Crossref","is-referenced-by-count":153,"title":["Minimum-Cost Reachability for Priced Time Automata"],"prefix":"10.1007","author":[{"given":"Gerd","family":"Behrmann","sequence":"first","affiliation":[]},{"given":"Ansgar","family":"Fehnker","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Hune","sequence":"additional","affiliation":[]},{"given":"Kim","family":"Larsen","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Pettersson","sequence":"additional","affiliation":[]},{"given":"Judi","family":"Romijn","sequence":"additional","affiliation":[]},{"given":"Frits","family":"Vaandrager","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,21]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Parosh Aziz Abdulla and Aletta Nyl\u00e9n. Better is better than well: On efficient verification of infinite-state systems. In Proc. of the 14th IEEE Symp. on Logic in Computer Science. IEEE, 2000.","DOI":"10.1109\/LICS.2000.855762"},{"key":"15_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/3-540-56922-7_16","volume-title":"Proc. of the 5th Int. Conf. on Computer Aided Verification","author":"R. Alur","year":"1993","unstructured":"R. Alur, C. Courcoubetis, and T. A. Henzinger. Computing accumulated delays in real-time systems. In Proc. of the 5th Int. Conf. on Computer Aided Verification, number 697 in Lecture Notes in Computer Science, pages 181\u2013193, 1993."},{"issue":"2","key":"15_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"R. Alur and D. Dill. Automata for Modelling Real-Time Systems. Theoretical Computer Science, 126(2):183\u2013236, April 1994.","journal-title":"Theoretical Computer Science"},{"key":"15_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-48983-5_6","volume-title":"Hybrid Systems: Computation and Control","author":"E. Asarin","year":"1999","unstructured":"E. Asarin and O. Maler. As soon as possible: Time optimal control for timed automata. In Hybrid Systems: Computation and Control, number 1569 in Lecture Notes in Computer Science, pages 19\u201330. Springer-Verlag, March 1999."},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Gerd Behrmann, Ansgar Fehnker, Thomas Hune, Kim Larsen, Paul Pettersson, and Judi Romijn. Efficient guiding towards cost-optimality in uppaal. Accepted for TACAS 2001.","DOI":"10.1007\/3-540-45319-9_13"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Gerd Behrmann, Ansgar Fehnker, Thomas Hune, Kim Larsen, Paul Pettersson, Judi Romijn, and Frits Vaandrager. Minimum-cost reachability for priced timed automata. Technical Report RS-01-03, BRICS, January 2001.","DOI":"10.7146\/brics.v8i3.20457"},{"key":"15_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/BFb0028779","volume-title":"Proc. of the 10th Int. Conf. on Computer Aided Verification","author":"M. Bozga","year":"1998","unstructured":"Marius Bozga, Conrado Daws, Oded Maler, Alfredo Olivero, Stavros Tripakis, and Sergio Yovine. Kronos: A Model-Checking Tool for Real-Time Systems. In Proc. of the 10th Int. Conf. on Computer Aided Verification, number 1427 in Lecture Notes in Computer Science, pages 546\u2013550. Springer-Verlag, 1998."},{"key":"15_CR8","series-title":"Lect Notes Comput Sci","first-page":"197","volume-title":"Proc. of Automatic Verification Methods for Finite State Systems","author":"D. Dill","year":"1989","unstructured":"David Dill. Timing Assumptions and Verification of Finite-State Concurrent Systems. In J. Sifakis, editor, Proc. of Automatic Verification Methods for Finite State Systems, number 407 in Lecture Notes in Computer Science, pages 197\u2013212. Springer-Verlag, 1989."},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Ansgar Fehnker. Scheduling a steel plant with timed automata. In Proceedings of the 6th International Conference on Real-Time Computing Systems and Applications (RTCSA99), pages 280\u2013286. IEEE Computer Society, 1999.","DOI":"10.1109\/RTCSA.1999.811256"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"T. A. Henzinger. The theory of hybrid automata. In Proc. of 11th Annual Symp. on Logic in Computer Science (LICS 96), pages 278\u2013292. IEEE Computer Society Press, 1996.","DOI":"10.1109\/LICS.1996.561342"},{"key":"15_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1007\/3-540-63166-6_48","volume-title":"Proc. of the 9th Int. Conf. on Computer Aided Verification","author":"T. A. Henzinger","year":"1997","unstructured":"Thomas A. Henzinger, Pei-Hsin Ho, and Howard Wong-Toi. HyTech: A Model Checker for Hybird Systems. In Orna Grumberg, editor, Proc. of the 9th Int. Conf. on Computer Aided Verification, number 1254 in Lecture Notes in Computer Science, pages 460\u2013463. Springer-Verlag, 1997."},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G. Higman","year":"1952","unstructured":"G. Higman. Ordering by divisibility in abstract algebras. Proc. of the London Math. Soc., 2:326\u2013336, 1952.","journal-title":"Proc. of the London Math. Soc."},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Thomas Hune, Kim G. Larsen, and Paul Pettersson. Guided Synthesis of Control Programs Using Uppaal. In Ten H. Lai, editor, Proc. of the IEEE ICDCS International Workshop on Distributed Systems Verification and Validation, pages E15\u2013E22. IEEE Computer Society Press, April 2000.","DOI":"10.7146\/brics.v7i37.20203"},{"issue":"1-2","key":"15_CR14","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/s100090050010","volume":"1","author":"K. G. Larsen","year":"1997","unstructured":"Kim G. Larsen, Paul Pettersson, and Wang Yi. Uppaal in a Nutshell. Int. Journal on Software Tools for Technology Transfer, 1(1-2):134\u2013152, October 1997.","journal-title":"Int. Journal on Software Tools for Technology Transfer"},{"issue":"3","key":"15_CR15","first-page":"271","volume":"6","author":"K. G. Larsen","year":"1999","unstructured":"Kim G. Larsen, Carsten Weise, Wang Yi, and Justin Pearson. Clock difference diagrams. Nordic Journal of Computing, 6(3):271\u2013298, 1999.","journal-title":"Nordic Journal of Computing"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"J. M\u00f8ller, J. Lichtenberg, H. R. Andersen, and H. Hulgaard. Difference decision diagrams. Technical Report IT-TR-1999-023, Department of Information Technology, Technical University of Denmark, February 1999.","DOI":"10.1007\/3-540-48168-0_9"},{"key":"15_CR17","unstructured":"Peter Niebert, Stavros Tripakis, and Sergio Yovine. Minimum-time reachability for timed automata. In IEEE Mediteranean Control Conference, 2000."},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Peter Niebert and Sergio Yovine. Computing optimal operation schemes for multi batch operation of chemical plants. VHS deliverable, May 1999. Draft.","DOI":"10.1007\/3-540-46430-1_29"}],"container-title":["Lecture Notes in Computer Science","Hybrid Systems: Computation and Control"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45351-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T11:24:32Z","timestamp":1556969072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45351-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418665","9783540453512"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45351-2_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}