{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T02:45:09Z","timestamp":1778121909881,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540423454","type":"print"},{"value":"9783540445852","type":"electronic"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[[2001]]},"DOI":"10.1007\/3-540-44585-4_47","type":"book-chapter","created":{"date-parts":[[2010,2,11]],"date-time":"2010-02-11T19:39:50Z","timestamp":1265917190000},"page":"493-505","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":77,"title":["As Cheap as Possible: Effcient Cost-Optimal Reachability for Priced Timed Automata"],"prefix":"10.1007","author":[{"given":"Kim","family":"Larsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerd","family":"Behrmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ed","family":"Brinksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ansgar","family":"Fehnker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Hune","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Pettersson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Judi","family":"Romijn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"47_CR1","first-page":"149","volume":"3","author":"D. Applegate","year":"1991","unstructured":"D. Applegate and W. Cook. A Computational Study of the Job-Shop Scheduling Problem. OSRA Journal on Computing 3, pages 149\u2013156, 1991.","journal-title":"OSRA Journal on Computing"},{"key":"47_CR2","unstructured":"P. Abdulla, K. Cerans, B. Jonsson, and T. Yih-Kuen. General decidability theorems for infinite-state systems, 1996."},{"key":"47_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1007\/BFb0032042","volume-title":"Proc. of Int. Colloquium on Algorithms, Languages and Programming","author":"R. Alur","year":"1990","unstructured":"R. Alur and D. Dill. Automata for Modelling Real-Time Systems. In Proc. of Int. Colloquium on Algorithms, Languages and Programming, number 443 in Lecture Notes in Computer Science, pages 322\u2013335, July 1990."},{"key":"47_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Proc. 21st Int. Coll. Automata, Languages, and Programming (ICALP\u201994)","author":"P. Abdulla","year":"1994","unstructured":"P. Abdulla and B. Jonsson. Undecidability of verifying programs with unreliable channels. In Proc. 21st Int. Coll. Automata, Languages, and Programming (ICALP\u201994), volume 820 of LNCS, 1994."},{"key":"47_CR5","doi-asserted-by":"crossref","unstructured":"R. Alun, S. La Torre, and G. J. Pappas. Optimal paths in weighted timed automata. To appear in HSCC2001.","DOI":"10.1007\/3-540-45351-2_8"},{"key":"47_CR6","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":"M. Bozga, C. Daws, O. Maler, A. Olivero, S. Tripakis, and S. 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":"47_CR7","doi-asserted-by":"crossref","unstructured":"G. Behrmann, A. Fehnker, T. Hune, K.G. Larsen, P. Pettersson, and J. Romijn. Efficient guiding towards cost-optimality in uppaal. To appear in Proceedings of TACAS\u20192001.","DOI":"10.7146\/brics.v8i4.20458"},{"key":"47_CR8","doi-asserted-by":"crossref","unstructured":"_G. Behrmann, A. Fehnker, T. Hune, K. G. Larsen, P. Pettersson, J. Romijn, and F. Vaandrager. Minimum-Cost Reachability for Priced Timed Automata. To appear in Proceedings of HSCC2001, 2001.","DOI":"10.7146\/brics.v8i3.20457"},{"issue":"2","key":"47_CR9","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/trsc.34.2.180.12302","volume":"34","author":"J.E. Beasley","year":"2000","unstructured":"J.E. Beasley, M. Krishnamoorthy, and D. Abramson. Scheduling Aircraft Landings-The Static Case. Transportation Science, 34(2):180\u2013197, 2000.","journal-title":"Transportation Science"},{"key":"47_CR10","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the 7th SPIN Workshop","author":"E. Brinksma","year":"2000","unstructured":"Ed Brinksma and Angelika Mader. Verification and optimization of a plc control schedule. In Proceedings of the 7th SPIN Workshop, volume 1885 of Lecture Notes in Computer Science. Springer Verlag, 2000."},{"key":"47_CR11","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of ICALP 94","author":"K. Cerans","year":"1994","unstructured":"K. Cerans. Deciding properties of integral relational automata. In Proceedings of ICALP 94, volume 820 of LNCS, 1994."},{"key":"47_CR12","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":"D. 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":"47_CR13","unstructured":"Jack J. Dongarra. Performance of Various Computers Using Standard Linear Equations Software. Technical Report CS-89-85, Computer Science Department, University of Tennessee, 2001. An up-to-date version of this report can be found at http:\/\/www.netlib.org\/benchmark\/performance.ps."},{"key":"47_CR14","doi-asserted-by":"crossref","unstructured":"A. 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":"47_CR15","series-title":"Lect Notes Comput Sci","volume-title":"Proc. 3rd Latin American Theoretical Informatics Symposium (LATIN\u201998)","author":"A. Finkel","year":"1998","unstructured":"A. Finkel and P. Schnoebelen. Fundamental structures in well-structured infinite transition systems. In Proc. 3rd Latin American Theoretical Informatics Symposium (LATIN\u201998), volume 1380 of LNCS, 1998."},{"issue":"1-2","key":"47_CR16","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"A. Finkel and Ph. Schnoebelen. Well structured transition systems everywhere. Theoretical Computer Science, 256(1-2):64\u201392, 2001.","journal-title":"Theoretical Computer Science"},{"key":"47_CR17","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":"T.A. Henzinger, P.-H. Ho, and H. Wong-Toi. HyTech: AModel 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":"47_CR18","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":"47_CR19","doi-asserted-by":"crossref","unstructured":"T. Hune, K.G. Larsen, and P. 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"},{"key":"47_CR20","unstructured":"Fredrik Larsson, Kim G. Larsen, Paul Pettersson, and Wang Yi. Efficient Verification of Real-Time Systems: Compact Data Structures and State-Space Reduction. In Proc. of the 18th IEEE Real-Time Systems Symposium, pages 14\u201324. IEEE Computer Society Press, December 1997."},{"issue":"1-2","key":"47_CR21","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/s100090050010","volume":"1","author":"K.G. Larsen","year":"1997","unstructured":"K.G. Larsen, P. Pettersson, and W. 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"},{"key":"47_CR22","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall, Englewood Cliffs, 1989."},{"key":"47_CR23","doi-asserted-by":"crossref","unstructured":"P. Niebert and S. 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"},{"key":"47_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/BFb0054185","volume-title":"Proceedings of the Fourth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201998)","author":"T.C. Ruys","year":"1998","unstructured":"T.C. Ruys and E. Brinksma. Experience with Literate Programming in the Modelling and Validation of Systems. In Bernhard Steffen, editor, Proceedings of the Fourth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201998), number 1384 in Lecture Notes in Computer Science (LNCS), pages 393\u2013408, Lisbon, Portugal, April 1998. Springer-Verlag, Berlin."},{"key":"47_CR25","unstructured":"T.G. Rokicki. Representing and Modeling Digital Circuits. PhD thesis, Stanford University, 1993."}],"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-44585-4_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T10:27:57Z","timestamp":1739874477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44585-4_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423454","9783540445852"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-44585-4_47","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"4 July 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}