{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:15:37Z","timestamp":1725747337515},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642410352"},{"type":"electronic","value":"9783642410369"}],"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-41036-9_1","type":"book-chapter","created":{"date-parts":[[2013,9,3]],"date-time":"2013-09-03T05:49:49Z","timestamp":1378187389000},"page":"1-18","source":"Crossref","is-referenced-by-count":8,"title":["Robustness in Timed Automata"],"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":"1_CR1","unstructured":"Asarin, E., Bouajjani, A.: Perturbed turing machines and hybrid systems. In: Proc. 16th Annual Symposium on Logic in Computer Science (LICS 2001), pp. 269\u2013278. IEEE Computer Society Press (2001)"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-540-85361-9_10","volume-title":"CONCUR 2008 - Concurrency Theory","author":"S. Akshay","year":"2008","unstructured":"Akshay, S., Bollig, B., Gastin, P., Mukund, M., Narayan Kumar, K.: Distributed Timed Automata with Independently Evolving Clocks. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 82\u201397. Springer, Heidelberg (2008)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Abdellatif, T., Combaz, J., Sifakis, J.: Model-based implementation of real-time applications. In: Proc. 10th International Workshop on Embedded Software (EMSOFT 2010), pp. 229\u2013238. ACM (2010)","DOI":"10.1145\/1879021.1879052"},{"issue":"2","key":"1_CR4","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":"1_CR5","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Kr\u010d\u00e1l, P., Yi, W.: Sampled semantics of timed automata. Logical Methods in Computer Science\u00a06(3:14) (2010)","DOI":"10.2168\/LMCS-6(3:14)2010"},{"key":"1_CR6","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":"1_CR7","unstructured":"Alur, R.: Techniques for Automatic Verification of Real-Time Systems. PhD thesis, Stanford University, Stanford, CA, USA (1991)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/11603009_21","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"K. Altisen","year":"2005","unstructured":"Altisen, K., Tripakis, S.: Implementation of timed automata: An issue of semantics or modeling? In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol.\u00a03829, pp. 273\u2013288. Springer, Heidelberg (2005)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-642-24310-3_9","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"N. Basset","year":"2011","unstructured":"Basset, N., Asarin, E.: Thin and thick timed regular languages. In: Fahrenberg, U., Tripakis, S. (eds.) FORMATS 2011. LNCS, vol.\u00a06919, pp. 113\u2013128. Springer, Heidelberg (2011)"},{"key":"1_CR10","unstructured":"Behrmann, G., David, A., Larsen, K.G., H\u00e5kansson, J., Pettersson, P., Yi, W., Hendriks, M.: Uppaal 4.0. In: Proc. 3rd International Conference on Quantitative Evaluation of Systems (QEST 2006), pp. 125\u2013126. IEEE Computer Society Press (2006)"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/BFb0028779","volume-title":"Computer Aided Verification","author":"M. Bozga","year":"1998","unstructured":"Bozga, M., Daws, C., Maler, O., Olivero, A., Tripakis, S., Yovine, S.: Kronos: a model-checking tool for real-time systems. In: Vardi, M.Y. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 546\u2013550. Springer, Heidelberg (1998)"},{"key":"1_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.M.T., 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":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/11682462_25","volume-title":"LATIN 2006: Theoretical Informatics","author":"P. Bouyer","year":"2006","unstructured":"Bouyer, P., Markey, N., Reynier, P.-A.: Robust model-checking of linear-time properties in timed automata. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 238\u2013249. Springer, Heidelberg (2006)"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-540-78499-9_12","volume-title":"Foundations of Software Science and Computational Structures","author":"P. Bouyer","year":"2008","unstructured":"Bouyer, P., Markey, N., Reynier, P.-A.: Robust analysis of timed automata via channel machines. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 157\u2013171. Springer, Heidelberg (2008)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-24310-3_8","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"P. Bouyer","year":"2011","unstructured":"Bouyer, P., Markey, N., Sankur, O.: Robust model-checking of timed automata via pumping in channel machines. In: Fahrenberg, U., Tripakis, S. (eds.) FORMATS 2011. LNCS, vol.\u00a06919, pp. 97\u2013112. Springer, Heidelberg (2011)"},{"key":"1_CR16","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\u00a0game-based\u00a0approach. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol.\u00a07392, pp. 128\u2013140. Springer, Heidelberg (2012)"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-40229-6_3","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"P. Bouyer","year":"2013","unstructured":"Bouyer, P., Markey, N., Sankur, O.: Robust weighted timed automata and games. In: Braberman, V., Fribourg, L. (eds.) FORMATS 2013. LNCS, vol.\u00a08053, pp. 31\u201346. Springer, Heidelberg (2013)"},{"key":"1_CR18","unstructured":"Brzozowski, J.A., Seger, C.-J.H.: Advances in asynchronous circuit theory. Bulletin of the European Association of Theoretical Computer Science, EATCS (1991)"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, T.A., Prabhu, V.S.: Timed parity games: Complexity and robustness. Logical Methods in Computer Science\u00a07(4) (2011)","DOI":"10.2168\/LMCS-7(4:8)2011"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-45873-5_13","volume-title":"Hybrid Systems: Computation and Control","author":"F. Cassez","year":"2002","unstructured":"Cassez, F., Henzinger, T.A., Raskin, J.-F.: A comparison of control problems for timed and hybrid systems. In: Tomlin, C.J., Greenstreet, M.R. (eds.) HSCC 2002. LNCS, vol.\u00a02289, pp. 134\u2013148. Springer, Heidelberg (2002)"},{"issue":"1-3","key":"1_CR21","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"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/11526841_11","volume-title":"FM 2005: Formal Methods","author":"M. Wulf De","year":"2005","unstructured":"De Wulf, M., Doyen, L., Raskin, J.-F.: Systematic Implementation of Real-Time Models. In: Fitzgerald, J.S., Hayes, I.J., Tarlecki, A. (eds.) FM 2005. LNCS, vol.\u00a03582, pp. 139\u2013156. Springer, Heidelberg (2005)"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-75454-1_11","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"C. Dima","year":"2007","unstructured":"Dima, C.: Dynamical properties of timed automata revisited. In: Raskin, J.-F., Thiagarajan, P.S. (eds.) FORMATS 2007. LNCS, vol.\u00a04763, pp. 130\u2013146. Springer, Heidelberg (2007)"},{"key":"1_CR24","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":"1_CR25","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)"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/11590156_25","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"P. Kr\u010d\u00e1l","year":"2005","unstructured":"Kr\u010d\u00e1l, P., Pel\u00e1nek, R.: On sampled semantics of timed systems. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 310\u2013321. Springer, Heidelberg (2005)"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/BFb0055349","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"A. Puri","year":"1998","unstructured":"Puri, A.: Dynamical properties of timed automata. In: Ravn, A.P., Rischel, H. (eds.) FTRTFT 1998. LNCS, vol.\u00a01486, pp. 210\u2013227. Springer, Heidelberg (1998)"},{"issue":"1-2","key":"1_CR28","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 automata. Discrete Event Dynamic Systems\u00a010(1-2), 87\u2013113 (2000)","journal-title":"Discrete Event Dynamic Systems"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1007\/978-3-642-39799-8_72","volume-title":"Computer Aided Verification","author":"O. Sankur","year":"2013","unstructured":"Sankur, O.: Shrinktech: A tool for the robustness analysis of timed automata. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol.\u00a08044, pp. 1006\u20131012. Springer, Heidelberg (2013)"},{"key":"1_CR30","unstructured":"Sankur, O., Bouyer, P., Markey, N.: Shrinking timed automata. In: Proc. 30th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011). LIPIcs, vol.\u00a013, pp. 375\u2013386. Leibniz-Zentrum f\u00fcr Informatik (2011)"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/978-3-642-40184-8_38","volume-title":"CONCUR 2013 \u2013 Concurrency Theory","author":"O. Sankur","year":"2013","unstructured":"Sankur, O., Bouyer, P., Markey, N., Reynier, P.-A.: Robust controller synthesis in timed automata. In: D\u2019Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013. LNCS, vol.\u00a08052, pp. 546\u2013560. Springer, Heidelberg (2013)"},{"key":"1_CR32","series-title":"IFIP","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-0-387-09680-3_36","volume-title":"Proc. 5th IFIP International Conference on Theoretical Computer Science (TCS 2008)","author":"M. Swaminathan","year":"2009","unstructured":"Swaminathan, M., Fr\u00e4nzle, M., Katoen, J.-P.: The surprising robustness of (closed) timed automata against clock-drift. In: Ausiello, G., Karhum\u00e4ki, J., Mauri, G., Ong, L. (eds.) Proc. 5th IFIP International Conference on Theoretical Computer Science (TCS 2008). IFIP, vol.\u00a0273, pp. 537\u2013553. Springer, Boston (2009)"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41036-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T22:06:59Z","timestamp":1558303619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41036-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642410352","9783642410369"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41036-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}