{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T00:11:04Z","timestamp":1775693464081,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540291312","type":"print"},{"value":"9783540319399","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561163_8","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:54:31Z","timestamp":1127832871000},"page":"162-182","source":"Crossref","is-referenced-by-count":48,"title":["Priced Timed Automata: Algorithms and Applications"],"prefix":"10.1007","author":[{"given":"Gerd","family":"Behrmann","sequence":"first","affiliation":[]},{"given":"Kim G.","family":"Larsen","sequence":"additional","affiliation":[]},{"given":"Jacob I.","family":"Rasmussen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Abdeddaim, Y., Kerbaa, A., Maler, O.: Task graph scheduling using timed automata. In: Proc. of International Parallel and Distributed Processing Symposium, pp. 8\u201315 (2003)","DOI":"10.1109\/IPDPS.2003.1213431"},{"issue":"2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.: A theory of timed automata. Theoretical Computer Science\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-45351-2_8","volume-title":"Hybrid Systems: Computation and Control","author":"R. Alur","year":"2001","unstructured":"Alur, R., La Torre, S., Pappas, G.: Optimal paths in weighted timed automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol.\u00a02034, pp. 49\u201362. Springer, Heidelberg (2001)"},{"issue":"2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/trsc.34.2.180.12302","volume":"34","author":"J.E. Beasley","year":"2000","unstructured":"Beasley, J.E., Krishnamoorthy, M., Sharaiha, Y.M., Abramson, D.: Scheduling aircraft landings - the static case. Transportation Science\u00a034(2), 180\u2013197 (2000)","journal-title":"Transportation Science"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-30080-9_7","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"G. Behrmann","year":"2004","unstructured":"Behrmann, G., David, A., Larsen, K.: A tutorial on Uppaal. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol.\u00a03185, pp. 200\u2013236. Springer, Heidelberg (2004)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-45319-9_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Behrmann","year":"2001","unstructured":"Behrmann, G., Fehnker, A., Hune, T., Larsen, K., Pettersson, P., Romijn, J.: Efficient guiding towards cost-optimality in Uppaal. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol.\u00a02031, pp. 174\u2013188. Springer, Heidelberg (2001)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-45351-2_15","volume-title":"Hybrid Systems: Computation and Control","author":"G. Behrmann","year":"2001","unstructured":"Behrmann, G., Fehnker, A., Hune, T., Larsen, K.G., Pettersson, P., Romijn, J.M.T., Vaandrager, F.W.: Minimum-cost reachability for priced timed automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol.\u00a02034, pp. 147\u2013161. Springer, Heidelberg (2001)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-24743-2_14","volume-title":"Hybrid Systems: Computation and Control","author":"P. Bouyer","year":"2004","unstructured":"Bouyer, P., Brinksma, E., Larsen, K.: Staying alive as cheaply as possible. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol.\u00a02993, pp. 203\u2013218. Springer, Heidelberg (2004)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-540-30538-5_13","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"P. Bouyer","year":"2004","unstructured":"Bouyer, P., Cassez, F., Fleury, E., Larsen, K.: Optimal strategies in priced timed game automata. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol.\u00a03328, pp. 148\u2013160. Springer, Heidelberg (2004)"},{"key":"8_CR10","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"11","volume-title":"Workshop on Games in Design and Verification","author":"P. Bouyer","year":"2004","unstructured":"Bouyer, P., Cassez, F., Fleury, E., Larsen, K.G.: Synthesis of optimal strategies using hytech. In: Workshop on Games in Design and Verification, Boston, MA, USA, July 2004. Electronic Notes in Theoretical Computer Science, vol.\u00a0119(1), pp. 11\u201331. Elsevier Science Publishers, Amsterdam (2004)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/BFb0028779","volume-title":"Computer Aided Verification","author":"M. Bozga","year":"1998","unstructured":"Bozga, M., Daws, C., Maler, O., Olivero, A., Tripakis, S., Yovine, S.: Kronos: A model-checking tool for real-time systems. In: Vardi, M.Y. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 546\u2013550. Springer, Heidelberg (1998)"},{"key":"8_CR12","unstructured":"UPPAAL CORA (January 2005), \n                  \n                    http:\/\/www.cs.aau.dk\/~behrmann\/cora"},{"key":"8_CR13","series-title":"Lecture Notex in Computer Science","first-page":"197","volume-title":"Proc. Of Automatic Verification Methods for Finite State Systems","author":"D.L. Dill","year":"1989","unstructured":"Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) Proc. Of Automatic Verification Methods for Finite State Systems. Lecture Notex in Computer Science, vol.\u00a0407, pp. 197\u2013212. Springer, Heidelberg (1989)"},{"key":"8_CR14","first-page":"280","volume-title":"Proc. of Real-Time and Embedded Computing Systems and Applications","author":"A. Fehnker","year":"1999","unstructured":"Fehnker, A.: Scheduling a steel plant with timed automata. In: Proc. of Real-Time and Embedded Computing Systems and Applications, p. 280. IEEE Computer Society, Los Alamitos (1999)"},{"issue":"1","key":"8_CR15","first-page":"43","volume":"8","author":"T. Hune","year":"2001","unstructured":"Hune, T., Larsen, K., Pettersson, P.: Guided synthesis of control programs using Uppaal. Nordic Journal of Computing\u00a08(1), 43\u201364 (2001)","journal-title":"Nordic Journal of Computing"},{"key":"8_CR16","unstructured":"IF (January 2005), \n                  \n                    http:\/\/www-verimag.imag.fr\/~async\/IF"},{"key":"8_CR17","unstructured":"Advanced Methods in Timed Systems (AMETIST) (January 2005), \n                  \n                    http:\/\/ametist.cs.utwente.nl"},{"issue":"3","key":"8_CR18","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0012-365X(78)90011-0","volume":"23","author":"R.M. Karp","year":"1978","unstructured":"Karp, R.M.: A characterization of the minimum mean-cycle in a digraph. Discrete Mathematics\u00a023(3), 309\u2013311 (1978)","journal-title":"Discrete Mathematics"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/3-540-44585-4_47","volume-title":"Computer Aided Verification","author":"K. Larsen","year":"2001","unstructured":"Larsen, K., Behrmann, G., Brinksma, E., Fehnker, A., Hune, T., Pettersson, P., Romijn, J.: As cheap as possible: Efficient cost-optimal reachability for priced timed automata. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, p. 493. Springer, Heidelberg (2001)"},{"issue":"1,2","key":"8_CR20","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/s100090050010","volume":"1","author":"K. Larsen","year":"1997","unstructured":"Larsen, K., Pettersson, P., Yi, W.: Uppaal in a nutshell. Int. Journal on Software Tools for Technology Transfer\u00a01(1,2), 134\u2013152 (1997)","journal-title":"Int. Journal on Software Tools for Technology Transfer"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-540-31982-5_15","volume-title":"Foundations of Software Science and Computational Structures","author":"K. Larsen","year":"2005","unstructured":"Larsen, K., Rasmussen, J.: Optimal conditional reachability for multi-priced timed automata. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 234\u2013249. Springer, Heidelberg (2005)"},{"key":"8_CR22","unstructured":"Verification of Hybrid Systems (VHS) (January 2005), \n                  \n                    http:\/\/www-verimag.imag.fr\/VHS\/"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-540-24730-2_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J. Rasmussen","year":"2004","unstructured":"Rasmussen, J., Larsen, K., Subramani, K.: Resource-optimal scheduling using priced timed automata. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 220\u2013235. Springer, Heidelberg (2004)"},{"key":"8_CR24","unstructured":"Stobbe, M.: Results on scheduling the sidmar steel plant using constraint programming. Internal report (2000)"},{"key":"8_CR25","unstructured":"UPPAAL (January 2005), \n                  \n                    http:\/\/www.uppaal.com"}],"container-title":["Lecture Notes in Computer Science","Formal Methods for Components and Objects"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561163_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T20:57:29Z","timestamp":1552424249000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561163_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291312","9783540319399"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11561163_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}