{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:46:22Z","timestamp":1725561982248},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212591"},{"type":"electronic","value":"9783540247432"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24743-2_14","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:02:22Z","timestamp":1280761342000},"page":"203-218","source":"Crossref","is-referenced-by-count":33,"title":["Staying Alive as Cheaply as Possible"],"prefix":"10.1007","author":[{"given":"Patricia","family":"Bouyer","sequence":"first","affiliation":[]},{"given":"Ed","family":"Brinksma","sequence":"additional","affiliation":[]},{"given":"Kim G.","family":"Larsen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","first-page":"149","volume":"3","author":"D. Applegate","year":"1991","unstructured":"Applegate, D., Cook, W.: A Computational Study of the Job-Shop Scheduling Problem. OSRA Journal on Computing\u00a03, 149\u2013156 (1991)","journal-title":"OSRA Journal on Computing"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/BFb0032042","volume-title":"Automata, Languages and Programming","author":"R. Alur","year":"1990","unstructured":"Alur, R., Dill, D.: Automata for Modeling Real-Time Systems. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol.\u00a0443, pp. 322\u2013335. Springer, Heidelberg (1990)"},{"issue":"2","key":"14_CR3","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 (TCS)\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theoretical Computer Science (TCS)"},{"key":"14_CR4","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.J.: Optimal Paths inWeighted Timed Automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol.\u00a02034, pp. 49\u201362. Springer, Heidelberg (2001)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","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":"Asarin, E., Maler, O.: As soon as possible: Time optimal control for timed automata. In: Vaandrager, F.W., van Schuppen, J.H. (eds.) HSCC 1999. LNCS, vol.\u00a01569, pp. 19\u201330. Springer, Heidelberg (1999)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/3-540-44585-4_46","volume-title":"Computer Aided Verification","author":"Y. Abdeddaim","year":"2001","unstructured":"Abdeddaim, Y., Maler, O.: Job-Shop Scheduling using Timed Automata. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 478\u2013492. Springer, Heidelberg (2001)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/3-540-46002-0_9","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Y. Abdedda\u00efm","year":"2002","unstructured":"Abdedda\u00efm, Y., Maler, O.: Preemptive Job-Shop Scheduling using Stopwatch Automata. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol.\u00a02280, pp. 113\u2013126. Springer, Heidelberg (2002)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Brinksma, E., Larsen, K.G.: Staying Alive as Cheaply as Possible. Research Report LSV\u201304\u20132, LSV, ENS de Cachan, France (2004)","DOI":"10.1007\/978-3-540-24743-2_14"},{"key":"14_CR9","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.G., Pettersson, P., Romijn, J., Vaandrager, F.: 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":"14_CR10","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., Vaandrager, F.: 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":"14_CR11","unstructured":"Bengtsson, J., Larsen, K.G., Larsson, F., Pettersson, P., Yi, W., Weise, C.: New Generation of UPPAAL. In: Proc. Int. Work. Software Tools for Technology Transfer (STTT 1998). BRICS Notes Series, pp. 43\u201352 (1998)"},{"issue":"1","key":"14_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10009-002-0079-0","volume":"4","author":"E. Brinksma","year":"2002","unstructured":"Brinksma, E., Mader, A., Fehnker, A.: Verification and Optimization of a PLC Control Schedule. Journal of Software Tools for Technology Transfer (STTT)\u00a04(1), 21\u201333 (2002)","journal-title":"Journal of Software Tools for Technology Transfer (STTT)"},{"issue":"10","key":"14_CR13","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1109\/43.728912","volume":"17","author":"A. Dasdan","year":"1998","unstructured":"Dasdan, A., Gupta, R.K.: Faster Maximum and Minimum Mean Cycle Algorithms for System Performance Analysis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems\u00a017(10), 889\u2013899 (1998)","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"14_CR14","first-page":"42","volume-title":"Proc. 36th ACM\/IEEE Design Automation Conf (DAC 1999)","author":"A. Dasdan","year":"1999","unstructured":"Dasdan, A., Irani, S., Gupta, R.K.: Efficient Algorithms for Optimum Cycle Mean and Optimum Cost to Time Ratio Problems. In: Proc. 36th ACM\/IEEE Design Automation Conf (DAC 1999), pp. 42\u201347. ACM, New York (1999)"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-44804-7_3","volume-title":"Process Algebra and Probabilistic Methods. Performance Modelling and Verification","author":"P.R. D\u2019Argenio","year":"2001","unstructured":"D\u2019Argenio, P.R., Jeannet, B., Jensen, H.E., Larsen, K.G.: Reachability analysis of probabilistic systems by successive refinements. In: de Luca, L., Gilmore, S. (eds.) PROBMIV 2001, PAPM-PROBMIV 2001, and PAPM 2001. LNCS, vol.\u00a02165, pp. 39\u201356. Springer, Heidelberg (2001)"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-45605-8_5","volume-title":"Process Algebra and Probabilistic Methods. Performance Modeling and Verification","author":"P.R. D\u2019Argenio","year":"2002","unstructured":"D\u2019Argenio, P.R., Jeannet, B., Jensen, H.E., Larsen, K.G.: Reduction and Refinement Strategies for Probabilistic Analysis. In: Hermanns, H., Segala, R. (eds.) PROBMIV 2002, PAPM-PROBMIV 2002, and PAPM 2002. LNCS, vol.\u00a02399, pp. 57\u201376. Springer, Heidelberg (2002)"},{"key":"14_CR17","first-page":"280","volume-title":"Proc. 6th Int. Conf. Real-Time Computing Systems and Applications (RTCSA 1999)","author":"A. Fehnker","year":"1999","unstructured":"Fehnker, A.: Scheduling a Steel Plant with Timed Automata. In: Proc. 6th Int. Conf. Real-Time Computing Systems and Applications (RTCSA 1999), pp. 280\u2013286. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"14_CR18","first-page":"15","volume-title":"Proc. IEEE ICDS Int. Work. Distributed Systems Verification and Validation","author":"T. Hune","year":"2000","unstructured":"Hune, T., Larsen, K.G., Pettersson, P.: Guided Synthesis of Control Programs Using UPPAAL. In: Proc. IEEE ICDS Int. Work. Distributed Systems Verification and Validation, pp. 15\u201322. IEEE Computer Society Press, Los Alamitos (2000)"},{"issue":"3","key":"14_CR19","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":"14_CR20","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.G. Larsen","year":"2001","unstructured":"Larsen, K.G., 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, pp. 493\u2013505. Springer, Heidelberg (2001)"},{"issue":"1-2","key":"14_CR21","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/s100090050010","volume":"1","author":"K.G. Larsen","year":"1997","unstructured":"Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a Nutshell. Journal of Software Tools for Technology Transfer (STTT)\u00a01(1-2), 134\u2013152 (1997)","journal-title":"Journal of Software Tools for Technology Transfer (STTT)"},{"key":"14_CR22","series-title":"IFIP Conf. Proc.","first-page":"485","volume-title":"Proc. 2nd IFIP Int. Conf. Theoretical Computer Science (TCS 2002)","author":"S. Torre La","year":"2002","unstructured":"La Torre, S., Mukhopadhyay, S., Murano, A.: Optimal-Reachability and Control for Acyclic Weighted Timed Automata. In: Proc. 2nd IFIP Int. Conf. Theoretical Computer Science (TCS 2002). IFIP Conf. Proc., vol.\u00a0223, pp. 485\u2013497. Kluwer, Dordrecht (2002)"},{"key":"14_CR23","unstructured":"Mader, A.: Deriving Schedules for a Smart Card Personalisation System (2003) (submitted)"},{"issue":"4","key":"14_CR24","doi-asserted-by":"publisher","first-page":"440","DOI":"10.3166\/ejc.7.440-454","volume":"7","author":"P. Niebert","year":"2001","unstructured":"Niebert, P., Yovine, S.: Computing Efficient Operations Schemes for Chemical Plants in Multi-batch Mode. European Journal of Control\u00a07(4), 440\u2013453 (2001)","journal-title":"European Journal of Control"},{"issue":"1-2","key":"14_CR25","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","volume":"158","author":"U. Zwick","year":"1996","unstructured":"Zwick, U., Paterson, M.: The Complexity of Mean Payoff Games on Graphs. Theoretical Computer Science (TCS)\u00a0158(1-2), 343\u2013359 (1996)","journal-title":"Theoretical Computer Science (TCS)"}],"container-title":["Lecture Notes in Computer Science","Hybrid Systems: Computation and Control"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24743-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:59:52Z","timestamp":1558299592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24743-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212591","9783540247432"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24743-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}