{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:56:48Z","timestamp":1725742608799},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642402289"},{"type":"electronic","value":"9783642402296"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-40229-6_3","type":"book-chapter","created":{"date-parts":[[2013,7,22]],"date-time":"2013-07-22T21:47:40Z","timestamp":1374529660000},"page":"31-46","source":"Crossref","is-referenced-by-count":4,"title":["Robust Weighted Timed Automata and Games"],"prefix":"10.1007","author":[{"given":"Patricia","family":"Bouyer","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Markey","sequence":"additional","affiliation":[]},{"given":"Ocan","family":"Sankur","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-540-27836-8_13","volume-title":"Automata, Languages and Programming","author":"R. Alur","year":"2004","unstructured":"Alur, R., Bernadsky, M., Madhusudan, P.: Optimal reachability for weighted timed games. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 122\u2013133. Springer, Heidelberg (2004)"},{"issue":"2","key":"3_CR2","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.L.: A theory of timed automata. Theoretical Computer Science\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-540-31954-2_5","volume-title":"Hybrid Systems: Computation and Control","author":"R. Alur","year":"2005","unstructured":"Alur, R., La Torre, S., Madhusudan, P.: Perturbed timed automata. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol.\u00a03414, pp. 70\u201385. Springer, Heidelberg (2005)"},{"key":"3_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 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":"3_CR5","unstructured":"Asarin, E., Bouajjani, A.: Perturbed Turing machines and hybrid systems. In: LICS 2001, pp. 269\u2013278. IEEE Comp. Soc. Press (2001)"},{"key":"3_CR6","unstructured":"Asarin, E., Maler, O., Pnueli, A., Sifakis, J.: Controller synthesis for timed automata. In: SSC 1998, pp. 469\u2013474. Elsevier Science (1998)"},{"key":"3_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.: 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)"},{"issue":"2","key":"3_CR8","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.-F.: On the optimal reachability problem of weighted timed automata. Formal Methods in System Design\u00a031(2), 135\u2013175 (2007)","journal-title":"Formal Methods in System Design"},{"issue":"5","key":"3_CR9","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":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-540-30538-5_13","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"P. Bouyer","year":"2004","unstructured":"Bouyer, P., Cassez, F., Fleury, E., Larsen, K.G.: Optimal strategies in priced timed game automata. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol.\u00a03328, pp. 148\u2013160. Springer, Heidelberg (2004)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-642-31585-5_15","volume-title":"Automata, Languages, and Programming","author":"P. Bouyer","year":"2012","unstructured":"Bouyer, P., Markey, N., Sankur, O.: Robust reachability in timed automata: A game-based approach. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol.\u00a07392, pp. 128\u2013140. Springer, Heidelberg (2012)"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Markey, N., Sankur, O.: Robust weighted timed automata and games. Research Report LSV-13-10, Laboratoire Sp\u00e9cification et V\u00e9rification, ENS Cachan, France, 25 p. (2013)","DOI":"10.1007\/978-3-642-40229-6_3"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/11603009_5","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"T. Brihaye","year":"2005","unstructured":"Brihaye, T., Bruy\u00e8re, V., Raskin, J.-F.: On optimal timed strategies. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol.\u00a03829, pp. 49\u201364. Springer, Heidelberg (2005)"},{"issue":"6","key":"3_CR14","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1016\/j.ic.2009.07.004","volume":"208","author":"K. Chatterjee","year":"2010","unstructured":"Chatterjee, K., Henzinger, T.A., Piterman, N.: Strategy logic. Information and Computation\u00a0208(6), 677\u2013693 (2010)","journal-title":"Information and Computation"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, T.A., Prabhu, V.S.: Timed parity games: Complexity and robustness. Logicical Methods in Computer Science 7(4) (2011)","DOI":"10.2168\/LMCS-7(4:8)2011"},{"issue":"1-3","key":"3_CR16","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10703-008-0056-7","volume":"33","author":"M. Wulf De","year":"2008","unstructured":"De Wulf, M., Doyen, L., Markey, N., Raskin, J.-F.: Robust safety of timed automata. Formal Methods in System Design\u00a033(1-3), 45\u201384 (2008)","journal-title":"Formal Methods in System Design"},{"issue":"3","key":"3_CR17","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s00165-005-0067-8","volume":"17","author":"M. Wulf De","year":"2005","unstructured":"De Wulf, M., Doyen, L., Raskin, J.-F.: Almost ASAP semantics: From timed models to timed implementations. Formal Aspects of Computing\u00a017(3), 319\u2013341 (2005)","journal-title":"Formal Aspects of Computing"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-48168-0_10","volume-title":"Computer Science Logic","author":"M. Fr\u00e4nzle","year":"1999","unstructured":"Fr\u00e4nzle, M.: Analysis of hybrid systems: An ounce of realism can save an infinity of states. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 126\u2013140. Springer, Heidelberg (1999)"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BFb0014736","volume-title":"Hybrid and Real-Time Systems","author":"V. Gupta","year":"1997","unstructured":"Gupta, V., Henzinger, T.A., Jagadeesan, R.: Robust timed automata. In: Maler, O. (ed.) HART 1997. LNCS, vol.\u00a01201, pp. 331\u2013345. Springer, Heidelberg (1997)"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-46430-1_15","volume-title":"Hybrid Systems: Computation and Control","author":"T.A. Henzinger","year":"2000","unstructured":"Henzinger, T.A., Raskin, J.-F.: Robust undecidability of timed and hybrid systems. In: Lynch, N.A., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol.\u00a01790, pp. 145\u2013159. Springer, Heidelberg (2000)"},{"issue":"1-2","key":"3_CR21","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1008387132377","volume":"10","author":"A. Puri","year":"2000","unstructured":"Puri, A.: Dynamical properties of timed systems. Discrete Event Dynamic Systems\u00a010(1-2), 87\u2013113 (2000)","journal-title":"Discrete Event Dynamic Systems"},{"key":"3_CR22","unstructured":"Sankur, O., Bouyer, P., Markey, N.: Shrinking timed automata. In: FSTTCS 2011. LIPIcs, vol.\u00a013, pp. 375\u2013386. Leibniz-Zentrum f\u00fcr Informatik (2011)"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1007\/978-3-642-40184-8_38","volume-title":"CONCUR 2013","author":"O. Sankur","year":"2013","unstructured":"Sankur, O., Bouyer, P., Markey, N., Reynier, P.-A.: Robust controller synthesis in timed automata. In: Aires, B., D\u2019Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013. LNCS, vol.\u00a08052, pp. 546\u2013560. Springer, Heidelberg (2013)"}],"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-642-40229-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T22:08:54Z","timestamp":1558303734000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40229-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402289","9783642402296"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40229-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}