{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T19:51:09Z","timestamp":1777578669945,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,7,1]],"date-time":"2006-07-01T00:00:00Z","timestamp":1151712000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form Method Syst Des"],"published-print":{"date-parts":[[2006,7]]},"DOI":"10.1007\/s10703-006-0014-1","type":"journal-article","created":{"date-parts":[[2006,6,30]],"date-time":"2006-06-30T22:08:10Z","timestamp":1151705290000},"page":"97-114","source":"Crossref","is-referenced-by-count":19,"title":["On using priced timed automata to achieve optimal scheduling"],"prefix":"10.1007","volume":"29","author":[{"given":"J. I.","family":"Rasmussen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. G.","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Subramani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,7,1]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Bozga M, Daws C, Maler O, Olivero A, Tripakis S, Yovine S (1998) Kronos: A model-checking tool for real-time systems. In: Proc. 10th International Conference on Computer Aided Verification vol. 1427, pp. 546\u2013550","DOI":"10.1007\/BFb0028779"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Larsen KG, Pettersson P, Yi W (1997) UPPAAL in a nutshell. Int J Softw Tools Technol Transfer 1(1\u20132):134\u2013152","DOI":"10.1007\/s100090050010"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Abdedda\u00efm Y, Kerbaa A, Maler O (2003) Task graph scheduling using timed automata. In: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), pp. 8+","DOI":"10.1109\/IPDPS.2003.1213431"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Behrmann G, Fehnker A, Hune T, Larsen K, Petterson P, Romijn J (2001) Efficient guiding towards cost-optimality in UPPAAL. Lecture Notes Comp Sci 2031:174+","DOI":"10.1007\/3-540-45319-9_13"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Larsen K, Behrmann G, Brinksma E, Fehnker A, Hune T, Pettersson P, Romijn J (2001) As cheap as possible: Efficient cost-optimal reachability for priced timed automata. Lect Notes Comp Sci 2102:493+","DOI":"10.1007\/3-540-44585-4_47"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Alur R, La Torre S, Pappas GJ (2001) Optimal paths in weighted timed automata. Lect Notes Comp Sci 2034:49+","DOI":"10.1007\/3-540-45351-2_8"},{"key":"14_CR7","unstructured":"Gruian F, Kuchcinski K (1999) Low-energy directed architecture selection and task scheduling. In: Proceeding of the 25th EuroMICRO Conference vol. 1, pp. 296\u2013302"},{"key":"14_CR8","unstructured":"Kwok Y-K, Ahmad I (1999) Benchmarking and comparison of the task graph scheduling algorithms. J Parallel Distrib Comp 59(3):381\u2013422"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Beasley JE, Krishnamoorthy M, Sharaiha YM, Abramson D (2000) Scheduling aircraft landings\u2014the static case. Transp Sci 34(2):180\u2013197","DOI":"10.1287\/trsc.34.2.180.12302"},{"key":"14_CR10","unstructured":"Berkelaar M (Oct. 2003) www.cs.sunysb.edu\/~algorith\/implement\/lpsol%ve\/implement.shtml"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Dantzig GB (1963) Linear programming and extensions. Princeton University Press, Princeton, NJ","DOI":"10.7249\/R366"},{"key":"14_CR12","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows\u2014theory, algorithms, and applications. Prentice Hall"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Cunningham WH (1976) A network simplex method. Math Prog 11:105\u2013106","DOI":"10.1007\/BF01580379"},{"key":"14_CR14","unstructured":"UPPAAL CORA (Nov. 2004) URL http:\/\/www.cs.aau.dk\/behrmann\/cora"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Behrmann G, Fehnker A, Hune T, Larsen K, Pettersson P, Romijn J, Vaandrager F (2001) Minimum-cost reachability for priced timed automata. Lect Notes Comp Sci 2034:147+","DOI":"10.1007\/3-540-45351-2_15"},{"key":"14_CR16","unstructured":"Alur R, Dill D (1990) Automata for modelling real-time systems. In: Proc. of Int. Colloquium on Algorithms, Languages and Programming, Lect Notes Comp Sci 443:322\u2013335"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Larsen K, Larsson F, Pettersson P, Yi W (1997) Efficient verification of real-time systems: Compact data structure and state space reduction. In: Proc. Real-Time Systems Symposium, pp. 14\u201324","DOI":"10.1109\/REAL.1997.641265"},{"key":"14_CR18","unstructured":"Tobita T, Kouda M, Kasahara H (2000) Performance evaluation of minimum execution time multiprocessor scheduling algorithms using standard task graph set. In: Proc. of PDPTA'00, pp 745\u2013751"}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-006-0014-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10703-006-0014-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-006-0014-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T17:14:54Z","timestamp":1736442894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10703-006-0014-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,7]]}},"alternative-id":["14"],"URL":"https:\/\/doi.org\/10.1007\/s10703-006-0014-1","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"value":"0925-9856","type":"print"},{"value":"1572-8102","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7]]}}}