{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:14:19Z","timestamp":1725491659928},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540754534"},{"type":"electronic","value":"9783540754541"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75454-1_6","type":"book-chapter","created":{"date-parts":[[2007,9,18]],"date-time":"2007-09-18T01:47:54Z","timestamp":1190080074000},"page":"53-68","source":"Crossref","is-referenced-by-count":4,"title":["Costs Are Expensive!"],"prefix":"10.1007","author":[{"given":"Patricia","family":"Bouyer","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Markey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"6_CR1","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"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/227595.227602","volume":"43","author":"R. Alur","year":"1996","unstructured":"Alur, R., Feder, T., Henzinger, T.A.: The benefits of relaxing punctuality. Journal of the ACM\u00a043(1), 116\u2013146 (1996)","journal-title":"Journal of the ACM"},{"key":"6_CR3","first-page":"390","volume-title":"Proc. 5th Annual Symposium on Logic in Computer Science (LICS 1990)","author":"R. Alur","year":"1990","unstructured":"Alur, R., Henzinger, T.A.: Real-time logics: Complexity and expressiveness. In: Proc. 5th Annual Symposium on Logic in Computer Science (LICS 1990), pp. 390\u2013401. IEEE Computer Society Press, Los Alamitos (1990)"},{"key":"6_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., Torre, S.L., Pappas, G.J.: 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)"},{"key":"6_CR5","first-page":"132","volume-title":"Proc. 15th Annual Symposium on Logic in Computer Science (LICS 2000)","author":"P.A. Abdulla","year":"2000","unstructured":"Abdulla, P.A., Nyl\u00e9n, A.: Better is better than well: On efficient verification of infinite-state systems. In: Proc. 15th Annual Symposium on Logic in Computer Science (LICS 2000), pp. 132\u2013140. IEEE Computer Society press, Los Alamitos (2000)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Brihaye, T., Bruy\u00e8re, V., Raskin, J.-F.: On the optimal reachability problem. Formal Methods in System Design (to appear, 2007)","DOI":"10.1007\/s10703-007-0035-4"},{"key":"6_CR7","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":"Hybrid Systems: Computation and Control","author":"P. Bouyer","year":"2004","unstructured":"Bouyer, P., Brinksma, E., Larsen, K.G.: Staying alive as cheaply as possible. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol.\u00a02993, pp. 203\u2013218. Springer, Heidelberg (2004)"},{"issue":"5","key":"6_CR8","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.ipl.2006.01.012","volume":"98","author":"P. Bouyer","year":"2006","unstructured":"Bouyer, P., Brihaye, T., Markey, N.: Improved undecidability results on weighted timed automata. Information Processing Letters\u00a098(5), 188\u2013194 (2006)","journal-title":"Information Processing Letters"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/978-3-540-30206-3_20","volume-title":"Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems","author":"T. Brihaye","year":"2004","unstructured":"Brihaye, T., Bruy\u00e8re, V., Raskin, J.-F.: Model-checking for weighted timed automata. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol.\u00a03253, pp. 277\u2013292. Springer, Heidelberg (2004)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/11603009_5","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"T. Brihaye","year":"2005","unstructured":"Brihaye, T., Bruy\u00e8re, V., Raskin, J.-F.: On optimal timed strategies. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 49\u201364. Springer, Heidelberg (2005)"},{"issue":"3","key":"6_CR11","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/j.ic.2005.12.001","volume":"204","author":"T. Brihaye","year":"2006","unstructured":"Brihaye, T., Bruy\u00e8re, V., Raskin, J.-F.: On model-checking timed automata with stopwatch observers. Information and Computation\u00a0204(3), 447\u2013478 (2006)","journal-title":"Information and Computation"},{"key":"6_CR12","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":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/978-3-540-71389-0_9","volume-title":"FOSSACS 2007","author":"P. Bouyer","year":"2007","unstructured":"Bouyer, P., Larsen, K.G., Markey, N.: Model-checking one-clock priced timed automata. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol.\u00a04423, pp. 108\u2013122. Springer, Heidelberg (2007)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/11944836_32","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"P. Bouyer","year":"2006","unstructured":"Bouyer, P., Larsen, K.G., Markey, N., Rasmussen, J.I.: Almost optimal strategies in one-clock priced timed automata. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol.\u00a04337, pp. 345\u2013356. Springer, Heidelberg (2006)"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Markey, N., Ouaknine, J., Worrell, J.: The cost of punctuality. In: Proc. 21st Annual Symposium on Logic in Computer Science (LICS\u201907). IEEE Computer Society Press (to appear, 2007)","DOI":"10.1109\/LICS.2007.49"},{"key":"6_CR16","unstructured":"Fleury, E.: Automates temporis\u00e9s avec mises \u00e0 jour. PhD thesis, \u00c9cole Normale Sup\u00e9rieure de Cachan, Cachan, France (2002)"},{"issue":"1","key":"6_CR17","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1006\/jcss.1998.1581","volume":"57","author":"T.A. Henzinger","year":"1998","unstructured":"Henzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.: What\u2019s decidable about hybrid automata? Journal of Computer and System Sciences\u00a057(1), 94\u2013124 (1998)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"6_CR18","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01995674","volume":"2","author":"R. Koymans","year":"1990","unstructured":"Koymans, R.: Specifying real-time properties with Metric Temporal Logic. Real-Time Systems\u00a02(4), 255\u2013299 (1990)","journal-title":"Real-Time Systems"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/978-3-540-28644-8_25","volume-title":"CONCUR 2004 - Concurrency Theory","author":"F. Laroussinie","year":"2004","unstructured":"Laroussinie, F., Markey, N., Schnoebelen, P.: Model checking timed automata with one or two clocks. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 387\u2013401. Springer, Heidelberg (2004)"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/978-3-540-31982-5_15","volume-title":"Foundations of Software Science and Computational Structures","author":"K.G. Larsen","year":"2005","unstructured":"Larsen, K.G., Rasmussen, J.I.: Optimal conditional scheduling for multi-priced timed automata. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 234\u2013249. Springer, Heidelberg (2005)"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/978-3-540-31982-5_16","volume-title":"Foundations of Software Science and Computational Structures","author":"S. Lasota","year":"2005","unstructured":"Lasota, S., Walukiewicz, I.: Alternating timed automata. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 250\u2013265. Springer, Heidelberg (2005)"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Lasota, S., Walukiewicz, I.: Alternating timed automata. ACM Transactions on Computational Logic (to appear, 2007)","DOI":"10.1145\/1342991.1342994"},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1109\/LICS.2005.33","volume-title":"Proc. 19th Annual Symposium on Logic in Computer Science (LICS 2005)","author":"J. Ouaknine","year":"2005","unstructured":"Ouaknine, J., Worrell, J.: On the decidability of Metric Temporal Logic. In: Proc. 19th Annual Symposium on Logic in Computer Science (LICS 2005), pp. 188\u2013197. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/11690634_15","volume-title":"Foundations of Software Science and Computation Structures","author":"J. Ouaknine","year":"2006","unstructured":"Ouaknine, J., Worrell, J.: On Metric Temporal Logic and faulty Turing machines. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006 and ETAPS 2006. LNCS, vol.\u00a03921, pp. 217\u2013230. Springer, Heidelberg (2006)"},{"issue":"1:8","key":"6_CR25","first-page":"1","volume":"3","author":"J. Ouaknine","year":"2007","unstructured":"Ouaknine, J., Worrell, J.: On the decidability and complexity of Metric Temporal Logic over finite words. Logical Methods in Computer Science\u00a03(1:8), 1\u201327 (2007)","journal-title":"Logical Methods in Computer Science"},{"key":"6_CR26","unstructured":"Raskin, J.-F.: Logics, Automata and Classical Theories for Deciding Real-Time. PhD thesis, University of Namur, Namur, Belgium (1999)"}],"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-75454-1_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:02:03Z","timestamp":1619521323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75454-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540754534","9783540754541"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75454-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}