{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T01:40:34Z","timestamp":1790041234083,"version":"4.0.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030255398","type":"print"},{"value":"9783030255404","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-25540-4_33","type":"book-chapter","created":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T15:02:35Z","timestamp":1562943755000},"page":"572-590","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Robust Controller Synthesis in Timed B\u00fcchi Automata: A Symbolic Approach"],"prefix":"10.1007","author":[{"given":"Damien","family":"Busatto-Gaston","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benjamin","family":"Monmege","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre-Alain","family":"Reynier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ocan","family":"Sankur","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"issue":"2","key":"33_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.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-95582-7_12","volume-title":"Formal Methods","author":"G Bacci","year":"2018","unstructured":"Bacci, G., Bouyer, P., Fahrenberg, U., Larsen, K.G., Markey, N., Reynier, P.-A.: Optimal and robust controller synthesis. In: Havelund, K., Peleska, J., Roscoe, B., de Vink, E. (eds.) FM 2018. LNCS, vol. 10951, pp. 203\u2013221. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-95582-7_12"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-27755-2_3","volume-title":"Lectures on Concurrency and Petri Nets","author":"J Bengtsson","year":"2004","unstructured":"Bengtsson, J., Yi, W.: Timed automata: semantics, algorithms and tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol. 3098, pp. 87\u2013124. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-27755-2_3"},{"key":"33_CR4","unstructured":"Berthomieu, B., Menasche, M.: An enumerative approach for analyzing time Petri nets. In: Mason, R.E.A. (ed.) Information Processing 83 - Proceedings of the 9th IFIP World Computer Congress (WCC\u201983), pp. 41\u201346. North-Holland\/IFIP, September 1983"},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/11539452_9","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"F Cassez","year":"2005","unstructured":"Cassez, F., David, A., Fleury, E., Larsen, K.G., Lime, D.: Efficient on-the-fly algorithms for the analysis of timed games. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 66\u201380. Springer, Heidelberg (2005). \n                      https:\/\/doi.org\/10.1007\/11539452_9"},{"key":"33_CR6","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. 2289, pp. 134\u2013148. Springer, Heidelberg (2002). \n                      https:\/\/doi.org\/10.1007\/3-540-45873-5_13"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-85778-5_10","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"K Chatterjee","year":"2008","unstructured":"Chatterjee, K., Henzinger, T.A., Prabhu, V.S.: Timed parity games: complexity and robustness. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol. 5215, pp. 124\u2013140. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-85778-5_10"},{"key":"33_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-48320-9_18","volume-title":"CONCUR\u201999 Concurrency Theory","author":"H Comon","year":"1999","unstructured":"Comon, H., Jurski, Y.: Timed automata and the theory of real numbers. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 242\u2013257. Springer, Heidelberg (1999). \n                      https:\/\/doi.org\/10.1007\/3-540-48320-9_18"},{"issue":"2","key":"33_CR9","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/TITS.2006.888605","volume":"8","author":"A D\u2019Ariano","year":"2007","unstructured":"D\u2019Ariano, A., Pranzo, M., Hansen, I.A.: Conflict resolution and train speed coordination for solving real-time timetable perturbations. IEEE Trans. Intell. Trans. Syst. 8(2), 208\u2013222 (2007)","journal-title":"IEEE Trans. Intell. Trans. Syst."},{"key":"33_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-52148-8_17","volume-title":"Automatic Verification Methods for Finite State Systems","author":"DL Dill","year":"1990","unstructured":"Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol. 407, pp. 197\u2013212. Springer, Heidelberg (1990). \n                      https:\/\/doi.org\/10.1007\/3-540-52148-8_17"},{"key":"33_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-662-49122-5_12","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"TA Henzinger","year":"2016","unstructured":"Henzinger, T.A., Otop, J., Samanta, R.: Lipschitz robustness of timed I\/O systems. In: Jobstmann, B., Leino, K.R.M. (eds.) VMCAI 2016. LNCS, vol. 9583, pp. 250\u2013267. Springer, Heidelberg (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-662-49122-5_12"},{"key":"33_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11813040_1","volume-title":"FM 2006: Formal Methods","author":"TA Henzinger","year":"2006","unstructured":"Henzinger, T.A., Sifakis, J.: The embedded systems design challenge. In: Misra, J., Nipkow, T., Sekerinski, E. (eds.) FM 2006. LNCS, vol. 4085, pp. 1\u201315. Springer, Heidelberg (2006). \n                      https:\/\/doi.org\/10.1007\/11813040_1"},{"key":"33_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-15643-4_17","volume-title":"Automated Technology for Verification and Analysis","author":"F Herbreteau","year":"2010","unstructured":"Herbreteau, F., Srivathsan, B.: Efficient on-the-fly emptiness check for timed b\u00fcchi automata. In: Bouajjani, A., Chin, W.-N. (eds.) ATVA 2010. LNCS, vol. 6252, pp. 218\u2013232. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-15643-4_17"},{"key":"33_CR14","unstructured":"Herbreteau, F., Srivathsan, B., Tran, T.-T., Walukiewicz, I.: Why liveness for timed automata is hard, and what we can do about it. In: FSTTCS 2016, LIPIcs, vol. 65, pp. 48:1\u201348:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"issue":"2","key":"33_CR15","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/s10703-011-0133-1","volume":"40","author":"F Herbreteau","year":"2012","unstructured":"Herbreteau, F., Srivathsan, B., Walukiewicz, I.: Efficient emptiness check for timed b\u00fcchi automata. Formal Methods Syst. Des. 40(2), 122\u2013146 (2012)","journal-title":"Formal Methods Syst. Des."},{"key":"33_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-19805-2_16","volume-title":"Foundations of Software Science and Computational Structures","author":"R Jaubert","year":"2011","unstructured":"Jaubert, R., Reynier, P.-A.: Quantitative robustness analysis of flat timed automata. In: Hofmann, M. (ed.) FoSSaCS 2011. LNCS, vol. 6604, pp. 229\u2013244. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-19805-2_16"},{"key":"33_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1007\/978-3-642-39799-8_69","volume-title":"Computer Aided Verification","author":"A Laarman","year":"2013","unstructured":"Laarman, A., Olesen, M.C., Dalsgaard, A.E., Larsen, K.G., van de Pol, J.: Multi-core emptiness checking of timed b\u00fcchi automata using inclusion abstraction. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 968\u2013983. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-39799-8_69"},{"key":"33_CR18","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.tcs.2013.08.015","volume":"515","author":"KG Larsen","year":"2014","unstructured":"Larsen, K.G., Legay, A., Traonouez, L.-M., Wasowski, A.: Robust synthesis for real-time systems. Theor. Comput. Sci. 515, 96\u2013122 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"33_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-04368-0_18","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"G Li","year":"2009","unstructured":"Li, G.: Checking timed b\u00fcchi automata emptiness using LU-abstractions. In: Ouaknine, J., Vaandrager, F.W. (eds.) FORMATS 2009. LNCS, vol. 5813, pp. 228\u2013242. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-04368-0_18"},{"key":"33_CR20","doi-asserted-by":"crossref","unstructured":"Prabhakar, P., Soto, M.G.: Formal synthesis of stabilizing controllers for switched systems. In: Proceedings of the 20th International Conference on Hybrid Systems: Computation and Control, HSCC 2017, New York, NY, USA, pp. 111\u2013120. ACM (2017)","DOI":"10.1145\/3049797.3049822"},{"key":"33_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-319-41528-4_27","volume-title":"Computer Aided Verification","author":"P Prabhakar","year":"2016","unstructured":"Prabhakar, P., Soto, M.G.: Counterexample guided abstraction refinement for stability analysis. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9779, pp. 495\u2013512. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-41528-4_27"},{"key":"33_CR22","doi-asserted-by":"crossref","unstructured":"Quaas, K., Shirmohammadi, M., Worrell, J.: Revisiting reachability in timed automata. In: LICS 2017. IEEE (2017)","DOI":"10.1109\/LICS.2017.8005098"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Roohi, N., Prabhakar, P., Viswanathan, M.: Robust model checking of timed automata under clock drifts. In: Proceedings of the 20th International Conference on Hybrid Systems: Computation and Control, HSCC 2017, New York, NY, USA, pp. 153\u2013162. ACM (2017)","DOI":"10.1145\/3049797.3049821"},{"key":"33_CR24","unstructured":"Sankur, O., Bouyer, P., Markey, N.: Shrinking timed automata. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011), LIPIcs, vol. 13, pp. 90\u2013102. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2011)"},{"key":"33_CR25","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. 8052, pp. 546\u2013560. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-40184-8_38"},{"key":"33_CR26","unstructured":"Tran, T.-T.: Verification of timed automata : reachability, liveness and modelling. (V\u00e9rification d\u2019automates temporis\u00e9s : s\u00fbret\u00e9, vivacit\u00e9 et mod\u00e9lisation). Ph.D. thesis, University of Bordeaux, France (2016)"},{"issue":"3","key":"33_CR27","doi-asserted-by":"publisher","first-page":"15:1","DOI":"10.1145\/1507244.1507245","volume":"10","author":"S Tripakis","year":"2009","unstructured":"Tripakis, S.: Checking timed b\u00fcchi automata emptiness on simulation graphs. ACM Trans. Comput. Log. 10(3), 15:1\u201315:19 (2009)","journal-title":"ACM Trans. Comput. Log."},{"issue":"3","key":"33_CR28","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10703-005-1632-8","volume":"26","author":"S Tripakis","year":"2005","unstructured":"Tripakis, S., Yovine, S., Bouajjani, A.: Checking timed b\u00fcchi automata emptiness efficiently. Formal Methods Syst. Des. 26(3), 267\u2013292 (2005)","journal-title":"Formal Methods Syst. Des."}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25540-4_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T15:07:08Z","timestamp":1562944028000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-25540-4_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030255398","9783030255404"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25540-4_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New York City, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/i-cav.org\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"258","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}