{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T02:45:31Z","timestamp":1778121931060,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,12,5]],"date-time":"2007-12-05T00:00:00Z","timestamp":1196812800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form Methods Syst Des"],"published-print":{"date-parts":[[2008,2]]},"DOI":"10.1007\/s10703-007-0043-4","type":"journal-article","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T16:11:48Z","timestamp":1196957508000},"page":"3-23","source":"Crossref","is-referenced-by-count":46,"title":["Optimal infinite scheduling for multi-priced timed automata"],"prefix":"10.1007","volume":"32","author":[{"given":"Patricia","family":"Bouyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ed","family":"Brinksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim G.","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,12,5]]},"reference":[{"key":"43_CR1","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1007\/3-540-44585-4_46","volume-title":"Procedings of 13th international conference on computer aided verification (CAV\u201901)","author":"Y Abdedda\u00efm","year":"2001","unstructured":"Abdedda\u00efm Y, Maler O (2001) Job-shop scheduling using timed automata. In: Procedings of 13th international conference on computer aided verification (CAV\u201901). Lecture notes in computer science, vol\u00a02102. Springer, Berlin, pp\u00a0478\u2013492"},{"key":"43_CR2","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/3-540-46002-0_9","volume-title":"Proceedings of 8th international conference on tools and algorithms for the construction and analysis of systems (TACAS\u201902)","author":"Y Abdedda\u00efm","year":"2002","unstructured":"Abdedda\u00efm Y, Maler O (2002) Preemptive job-shop scheduling using stopwatch automata. In: Proceedings of 8th international conference on tools and algorithms for the construction and analysis of systems (TACAS\u201902). Lecture notes in computer science, vol\u00a02280. Springer, Berlin, pp\u00a0113\u2013126"},{"key":"43_CR3","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1007\/BFb0032042","volume-title":"Proceedings of 17th international colloquium on automata, languages and programming (ICALP\u201990)","author":"R Alur","year":"1990","unstructured":"Alur R, Dill D (1990) Automata for modeling real-time systems. In: Proceedings of 17th international colloquium on automata, languages and programming (ICALP\u201990). Lecture notes in computer science, vol\u00a0443. Springer, Berlin, pp\u00a0322\u2013335"},{"issue":"2","key":"43_CR4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur R, Dill D (1994) A theory of timed automata. Theor Comput Sci 126(2):183\u2013235","journal-title":"Theor Comput Sci"},{"key":"43_CR5","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/978-3-540-27836-8_13","volume-title":"Proceedings of 31st international colloquium on automata, languages and programming (ICALP\u201904)","author":"R Alur","year":"2004","unstructured":"Alur R, Bernadsky M, Madhusudan P (2004) Optimal reachability in weighted timed games. In: Proceedings of 31st international colloquium on automata, languages and programming (ICALP\u201904). Lecture notes in computer science, vol\u00a03142. Springer, Berlin, pp\u00a0122\u2013133"},{"key":"43_CR6","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/3-540-45351-2_8","volume-title":"Proceedings of 4th international workshop on hybrid systems: computation and control (HSCC\u201901)","author":"R Alur","year":"2001","unstructured":"Alur R, La Torre S, Pappas GJ (2001) Optimal paths in weighted timed automata. In: Proceedings of 4th international workshop on hybrid systems: computation and control (HSCC\u201901). Lecture notes in computer science, vol\u00a02034. Springer, Berlin, pp\u00a049\u201362"},{"key":"43_CR7","first-page":"149","volume":"3","author":"D Applegate","year":"1991","unstructured":"Applegate D, Cook W (1991) A computational study of the job-shop scheduling problem. OSRA J Comput 3:149\u2013156","journal-title":"OSRA J Comput"},{"key":"43_CR8","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/3-540-48983-5_6","volume-title":"Proceedings of 2nd international workshop on hybrid systems: computation and control (HSCC\u201999)","author":"E Asarin","year":"1999","unstructured":"Asarin E, Maler O (1999) As soon as possible: Time optimal control for timed automata. In: Proceedings of 2nd international workshop on hybrid systems: computation and control (HSCC\u201999). Lecture notes in computer science, vol\u00a01569. Springer, Berlin, pp\u00a019\u201330"},{"key":"43_CR9","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-45319-9_13","volume-title":"Proceedings of 7th international conference on tools and algorithms for the construction and analysis of systems (TACAS\u201901)","author":"G Behrmann","year":"2001","unstructured":"Behrmann G, Fehnker A, Hune Th, Larsen KG, Pettersson P, Romijn J, Vaandrager F (2001) Efficient guiding towards cost-optimality in $\\mathsf{uppaal}$ . In: Proceedings of 7th international conference on tools and algorithms for the construction and analysis of systems (TACAS\u201901). Lecture notes in computer science, vol\u00a02031. Springer, Berlin, pp\u00a0174\u2013188"},{"key":"43_CR10","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/3-540-45351-2_15","volume-title":"Proceedings of 4th international workshop on hybrid systems: computation and control (HSCC\u201901)","author":"G Behrmann","year":"2001","unstructured":"Behrmann G, Fehnker A, Hune Th, Larsen KG, Pettersson P, Romijn J, Vaandrager F (2001) Minimum-cost reachability for priced timed automata. In: Proceedings of 4th international workshop on hybrid systems: computation and control (HSCC\u201901). Lecture notes in computer science, vol\u00a02034. Springer, Berlin, pp\u00a0147\u2013161"},{"key":"43_CR11","unstructured":"Bengtsson J, Larsen KG, Larsson F, Pettersson P, Yi W, Weise C (1998) New generation of $\\mathsf{uppaal}$ . In: Proceedings of international workshop on software tools for technology transfer (STTT\u201998). BRICS notes series, pp\u00a043\u201352"},{"key":"43_CR12","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/978-3-540-24743-2_14","volume-title":"Proceedings of 7th international workshop on hybrid systems: computation and control (HSCC\u201904)","author":"P Bouyer","year":"2004","unstructured":"Bouyer P, Brinksma E, Larsen KG (2004) Staying alive as cheaply as possible. In: Proceedings of 7th international workshop on hybrid systems: computation and control (HSCC\u201904). Lecture notes in computer science, vol\u00a02993. Springer, Berlin, pp\u00a0203\u2013218"},{"key":"43_CR13","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/978-3-540-30538-5_13","volume-title":"Proceedings of 24th conference on foundations of software technology and theoretical computer science (FST&TCS\u201904)","author":"P Bouyer","year":"2004","unstructured":"Bouyer P, Cassez F, Fleury E, Larsen KG (2004) Optimal strategies in priced timed game automata. In: Proceedings of 24th conference on foundations of software technology and theoretical computer science (FST&TCS\u201904). Lecture notes in computer science, vol\u00a03328. Springer, Berlin, pp\u00a0148\u2013160"},{"issue":"1","key":"43_CR14","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10009-002-0079-0","volume":"4","author":"E Brinksma","year":"2002","unstructured":"Brinksma E, Mader A, Fehnker A (2002) Verification and optimization of a PLC control schedule. J\u00a0Softw Tools Technol Trans 4(1):21\u201333","journal-title":"J\u00a0Softw Tools Technol Trans"},{"key":"43_CR15","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/3-540-44804-7_3","volume-title":"Proceedings of 1st joint international workshop on process algebra and probabilistic methods, performance modeling and verification (PAPM-PROBMIV\u201901)","author":"PR D\u2019Argenio","year":"2001","unstructured":"D\u2019Argenio PR, Jeannet B, Jensen HE, Larsen KG (2001) Reachability analysis of probabilistic systems by successive refinements. In: Proceedings of 1st joint international workshop on process algebra and probabilistic methods, performance modeling and verification (PAPM-PROBMIV\u201901). Lecture notes in computer science, vol\u00a02165. Springer, Berlin, pp\u00a039\u201356"},{"key":"43_CR16","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/3-540-45605-8_5","volume-title":"Proceedings of 2nd joint international workshop on process algebra and probabilistic methods, performance modeling and verification (PAPM-PROBMIV\u201902)","author":"PR D\u2019Argenio","year":"2002","unstructured":"D\u2019Argenio PR, Jeannet B, Jensen HE, Larsen KG (2002) Reduction and refinement strategies for probabilistic analysis. In: Proceedings of 2nd joint international workshop on process algebra and probabilistic methods, performance modeling and verification (PAPM-PROBMIV\u201902). Lecture notes in computer science, vol\u00a02399. Springer, Berlin, pp\u00a057\u201376"},{"issue":"10","key":"43_CR17","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1109\/43.728912","volume":"17","author":"A Dasdan","year":"1998","unstructured":"Dasdan A, Gupta RK (1998) Faster maximum and minimum mean cycle algorithms for system performance analysis. IEEE Trans Comput Aided Des Integr Circuits Syst 17(10):889\u2013899","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"43_CR18","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/309847.309862","volume-title":"Proceedings of 36th ACM\/IEEE design automation conference (DAC\u201999)","author":"A Dasdan","year":"1999","unstructured":"Dasdan A, Irani S, Gupta RK (1999) Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems. In: Proceedings of 36th ACM\/IEEE design automation conference (DAC\u201999). ACM, New York, pp\u00a037\u201342"},{"key":"43_CR19","first-page":"280","volume-title":"Proceedings of 6th international conference on real-time computing systems and applications (RTCSA\u201999)","author":"A Fehnker","year":"1999","unstructured":"Fehnker A (1999) Scheduling a steel plant with timed automata. In: Proceedings of 6th international conference on real-time computing systems and applications (RTCSA\u201999). IEEE Computer Society, Los\u00a0Alamitos, pp\u00a0280\u2013286"},{"key":"43_CR20","first-page":"E15","volume-title":"Proceedings of IEEE ICDS international workshop on distributes systems verification and validation","author":"Th Hune","year":"2000","unstructured":"Hune Th, Larsen KG, Pettersson P (2000) Guided synthesis of control programs using $\\mathsf{uppaal}$ . In: Proceedings of IEEE ICDS international workshop on distributes systems verification and validation. IEEE Computer Society, Los Alamitos, pp\u00a0E15\u2013E22"},{"issue":"3","key":"43_CR21","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(78)90011-0","volume":"23","author":"RM Karp","year":"1978","unstructured":"Karp RM (1978) A characterization of the minimum mean-cycle in a digraph. Discrete Math 23(3):309\u2013311","journal-title":"Discrete Math"},{"key":"43_CR22","series-title":"IFIP conference proceedings","first-page":"485","volume-title":"Proceedings of 2nd IFIP international conference on theoretical computer science (TCS 2002)","author":"S La Torre","year":"2002","unstructured":"La Torre S, Mukhopadhyay S, Murano A (2002) Optimal-reachability and control for acyclic weighted timed automata. In: Proceedings of 2nd IFIP international conference on theoretical computer science (TCS 2002). IFIP conference proceedings, vol\u00a0223. Kluwer Academic, Dordrecht, pp\u00a0485\u2013497"},{"issue":"1\u20132","key":"43_CR23","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/s100090050010","volume":"1","author":"KG Larsen","year":"1997","unstructured":"Larsen KG, Pettersson P, Yi W (1997) UPPAAL in a nutshell. J Softw Tools Technol Transf 1(1\u20132):134\u2013152","journal-title":"J Softw Tools Technol Transf"},{"key":"43_CR24","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/3-540-44585-4_47","volume-title":"Proceedings of 13th international conference on computer aided verification (CAV\u201901)","author":"KG Larsen","year":"2001","unstructured":"Larsen KG, 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. In: Proceedings of 13th international conference on computer aided verification (CAV\u201901). Lecture notes in computer science, vol\u00a02102. Springer, Berlin, pp\u00a0493\u2013505"},{"key":"43_CR25","unstructured":"Mader A (2004) Deriving schedules for a smart card personalisation system. Technical report TR-CTIT-04-05, Centre for Telematics and Information Technology, University of Twente, The Netherlands"},{"issue":"4","key":"43_CR26","doi-asserted-by":"crossref","first-page":"440","DOI":"10.3166\/ejc.7.440-454","volume":"7","author":"P Niebert","year":"2001","unstructured":"Niebert P, Yovine S (2001) Computing efficient operations schemes for chemical plants in multi-batch mode. Eur J Control 7(4):440\u2013453","journal-title":"Eur J Control"},{"key":"43_CR27","volume-title":"Computational complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou CH (1994) Computational complexity. Addison-Wesley, Reading"},{"issue":"1\u20132","key":"43_CR28","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","volume":"158","author":"U Zwick","year":"1996","unstructured":"Zwick U, Paterson M (1996) The complexity of mean payoff games on graphs. Theor Comput Sci 158 (1\u20132):343\u2013359","journal-title":"Theor Comput Sci"}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-007-0043-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10703-007-0043-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-007-0043-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T04:48:59Z","timestamp":1684126139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10703-007-0043-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,5]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["43"],"URL":"https:\/\/doi.org\/10.1007\/s10703-007-0043-4","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"value":"0925-9856","type":"print"},{"value":"1572-8102","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,5]]}}}