{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:29:41Z","timestamp":1725517781995},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540857778"},{"type":"electronic","value":"9783540857785"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85778-5_5","type":"book-chapter","created":{"date-parts":[[2008,8,29]],"date-time":"2008-08-29T17:32:04Z","timestamp":1220031124000},"page":"48-62","source":"Crossref","is-referenced-by-count":5,"title":["Concavely-Priced Timed Automata"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Jurdzi\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashutosh","family":"Trivedi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_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":"Computer Aided Verification","author":"Y. Abdedda\u00efm","year":"2001","unstructured":"Abdedda\u00efm, 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)"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/inco.1993.1024","volume":"104","author":"R. Alur","year":"1993","unstructured":"Alur, R., Courcoubetis, C., Dill, D.: Model-checking in dense real-time. Information and Computation\u00a0104(1), 2\u201334 (1993)","journal-title":"Information and Computation"},{"issue":"2","key":"5_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1023\/A:1008626013578","volume":"11","author":"R. Alur","year":"1997","unstructured":"Alur, R., Courcoubetis, C., Henzinger, T.A.: Computing accumulated delays in real-time systems. Formal Methods in System Design\u00a011(2), 137\u2013155 (1997)","journal-title":"Formal Methods in System Design"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Alur, R., Dill, D.: A theory of timed automata. In: Theoretical Computer Science, vol.\u00a0126, pp. 183\u2013235 (1994)","DOI":"10.1016\/0304-3975(94)90010-8"},{"issue":"3","key":"5_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.tcs.2003.10.038","volume":"318","author":"R. Alur","year":"2004","unstructured":"Alur, R., La Torre, S., Pappas, G.J.: Optimal paths in weighted timed automata. Theoretical Computer Science\u00a0318(3), 297\u2013322 (2004)","journal-title":"Theoretical Computer Science"},{"key":"5_CR6","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":"5_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., 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":"5_CR8","unstructured":"Bertsekas, D.P., Nedi\u0107, A., Ozdaglar, A.E.: Convex Analysis and Optimization. Athena Scientific (2003)"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2006.04.002","volume":"158","author":"P. Bouyer","year":"2006","unstructured":"Bouyer, P.: Weighted timed automata: Model-checking and games. Electr. Notes Theor. Comput. Sci.\u00a0158, 3\u201317 (2006)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10703-007-0035-4","volume":"31","author":"P. Bouyer","year":"2007","unstructured":"Bouyer, P., Brihaye, T., Bruy\u00e8re, V., Raskin, J.: On the optimal reachability problem on weighted timed automata. Formal Methods in System Design\u00a031(2), 135\u2013175 (2007)","journal-title":"Formal Methods in System Design"},{"issue":"1","key":"5_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10703-007-0043-4","volume":"32","author":"P. Bouyer","year":"2008","unstructured":"Bouyer, P., Brinksma, E., Larsen, K.G.: Optimal infinite scheduling for multi-priced timed automata. Formal Methods in System Design\u00a032(1), 3\u201323 (2008)","journal-title":"Formal Methods in System Design"},{"key":"5_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S. Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1007\/978-3-540-73420-8_71","volume-title":"Automata, Languages and Programming","author":"T. Brihaye","year":"2007","unstructured":"Brihaye, T., Henzinger, T.A., Prabhu, V.S., Raskin, J.: Minimum-time reachability in timed games. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 825\u2013837. Springer, Heidelberg (2007)"},{"key":"5_CR14","first-page":"385","volume-title":"FMSD 1992","author":"C. Courcoubetis","year":"1992","unstructured":"Courcoubetis, C., Yannakakis, M.: Minimum and maximum delay problems in real-time systems. In: FMSD 1992, vol.\u00a01, pp. 385\u2013415. Kluwer, Dordrecht (1992)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1007\/978-3-540-73420-8_72","volume-title":"Automata, Languages and Programming","author":"M. Jurdzi\u0144ski","year":"2007","unstructured":"Jurdzi\u0144ski, M., Trivedi, A.: Reachability-time games on timed automata. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 838\u2013849. Springer, Heidelberg (2007)"},{"issue":"2","key":"5_CR16","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1006\/inco.1998.2774","volume":"150","author":"Y. Kesten","year":"1999","unstructured":"Kesten, Y., Pnueli, A., Sifakis, J., Yovine, S.: Decidable integration graphs. Information and Computation\u00a0150(2), 209\u2013243 (1999)","journal-title":"Information and Computation"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"5_CR18","series-title":"McGraw-Hill Series in Systems Science","volume-title":"Nonlinear Programming","author":"O.L. Mangasarian","year":"1969","unstructured":"Mangasarian, O.L.: Nonlinear Programming. McGraw-Hill Series in Systems Science. McGraw-Hill, New York (1969)"},{"key":"5_CR19","volume-title":"MED 2000","author":"P. Niebert","year":"2000","unstructured":"Niebert, P., Tripakis, S., Yovine, S.: Minimum-time reachability for timed automata. In: MED 2000. IEEE Comp. Soc. Press, Los Alamitos (2000)"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85778-5_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:49:23Z","timestamp":1619524163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85778-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540857778","9783540857785"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85778-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}