{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T16:41:11Z","timestamp":1782319271846,"version":"3.54.5"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031773815","type":"print"},{"value":"9783031773822","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T00:00:00Z","timestamp":1732579200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T00:00:00Z","timestamp":1732579200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-77382-2_20","type":"book-chapter","created":{"date-parts":[[2024,11,25]],"date-time":"2024-11-25T19:26:58Z","timestamp":1732562818000},"page":"347-365","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Execution-Time Opacity Control for\u00a0Timed Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8473-9555","authenticated-orcid":false,"given":"\u00c9tienne","family":"Andr\u00e9","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7538-8826","authenticated-orcid":false,"given":"Marie","family":"Duflot","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3775-6496","authenticated-orcid":false,"given":"Laetitia","family":"Laversa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0875-300X","authenticated-orcid":false,"given":"Engel","family":"Lefaucheux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,11,26]]},"reference":[{"issue":"2","key":"20_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. TCS 126(2), 183\u2013235 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90010-8","journal-title":"TCS"},{"issue":"1\u20132","key":"20_CR2","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0304-3975(97)00173-4","volume":"211","author":"R Alur","year":"1999","unstructured":"Alur, R., Fix, L., Henzinger, T.A.: Event-clock automata: a determinizable class of timed automata. TCS 211(1\u20132), 253\u2013273 (1999). https:\/\/doi.org\/10.1016\/S0304-3975(97)00173-4","journal-title":"TCS"},{"key":"20_CR3","doi-asserted-by":"publisher","unstructured":"Alur, R., Henzinger, T.A., Vardi, M.Y.: Parametric real-time reasoning. In: STOC, pp. 592\u2013601. ACM (1993). https:\/\/doi.org\/10.1145\/167088.167242","DOI":"10.1145\/167088.167242"},{"key":"20_CR4","doi-asserted-by":"publisher","unstructured":"Ammar, I., El\u00a0Touati, Y., Yeddes, M., Mullins, J.: Bounded opacity for timed systems. J. Inf. Secur. Appl. 61, 1\u201313 (2021). https:\/\/doi.org\/10.1016\/j.jisa.2021.102926","DOI":"10.1016\/j.jisa.2021.102926"},{"key":"20_CR5","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/978-3-031-71162-6_32","volume-title":"FM","author":"J An","year":"2024","unstructured":"An, J., Gao, Q., Wang, L., Zhan, N., Hasuo, I.: The opacity of timed automata. In: Platzer, A., Rozier, K.Y., Pradella, M., Rossi, M. (eds.) FM. LNCS, vol. 14933, pp. 620\u2013637. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-71162-6_32"},{"key":"20_CR6","doi-asserted-by":"publisher","unstructured":"Andr\u00e9, \u00c9., Bolat, S., Lefaucheux, E., Marinho, D.: strategFTO: untimed control for timed opacity. In: FTSCS, pp. 27\u201333. ACM (2022). https:\/\/doi.org\/10.1145\/3563822.3568013","DOI":"10.1145\/3563822.3568013"},{"key":"20_CR7","unstructured":"Andr\u00e9, \u00c9., Duflot, M., Laversa, L., Lefaucheux, E.: Execution-time opacity control for timed automata. Technical, report, abs\/2409.10336, arXiv (2024). http:\/\/arxiv.org\/abs\/2409.10336"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Andr\u00e9, \u00c9., D\u00e9pernet, S., Lefaucheux, E.: The bright side of timed opacity. In: Ogata, K., Sun, M., M\u00e9ry, D. (eds.) ICFEM (2024, to appear)","DOI":"10.1007\/978-981-96-0617-7_4"},{"key":"20_CR9","doi-asserted-by":"publisher","unstructured":"Andr\u00e9, \u00c9., Kryukov, A.: Parametric non-interference in timed automata. In: ICECCS, pp. 37\u201342 (2020). https:\/\/doi.org\/10.1109\/ICECCS51672.2020.00012","DOI":"10.1109\/ICECCS51672.2020.00012"},{"key":"20_CR10","doi-asserted-by":"publisher","unstructured":"Andr\u00e9, \u00c9., Lefaucheux, E., Lime, D., Marinho, D., Sun, J.: Configuring timing parameters to ensure execution-time opacity in timed automata. In: TiCSA. Electronic Proceedings in Theoretical Computer Science, vol.\u00a0392, pp. 1\u201326 (2023). https:\/\/doi.org\/10.4204\/EPTCS.392.1. Invited paper","DOI":"10.4204\/EPTCS.392.1"},{"issue":"4","key":"20_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3502851","volume":"31","author":"\u00c9 Andr\u00e9","year":"2022","unstructured":"Andr\u00e9, \u00c9., Lime, D., Marinho, D., Sun, J.: Guaranteeing timed opacity using parametric timed model checking. ACM Trans. Softw. Eng. Methodol. 31(4), 1\u201336 (2022). https:\/\/doi.org\/10.1145\/3502851","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"issue":"6","key":"20_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3534967","volume":"55","author":"J Arcile","year":"2023","unstructured":"Arcile, J., Andr\u00e9, \u00c9.: Timed automata as a formalism for expressing security: a survey on theory and practice. ACM Comput. Surv. 55(6), 1\u201336 (2023). https:\/\/doi.org\/10.1145\/3534967","journal-title":"ACM Comput. Surv."},{"key":"20_CR13","doi-asserted-by":"publisher","unstructured":"Asarin, E., Maler, O., Pnueli, A., Sifakis, J.: Controller synthesis for timed automata. IFAC Proc. Vol. 31(18), 447\u2013452 (1998). https:\/\/doi.org\/10.1016\/S1474-6670(17)42032-5. Proceedings of the 5th IFAC Conference on System Structure and Control (SSC 1998)","DOI":"10.1016\/S1474-6670(17)42032-5"},{"key":"20_CR14","unstructured":"Barbuti, R., Francesco, N.D., Santone, A., Tesei, L.: A notion of non-interference for timed automata. FI 51(1-2), 1\u201311 (2002)"},{"key":"20_CR15","unstructured":"Barbuti, R., Tesei, L.: A decidable notion of timed non-interference. FI 54(2-3), 137\u2013150 (2003)"},{"key":"20_CR16","doi-asserted-by":"publisher","unstructured":"Benattar, G., Cassez, F., Lime, D., Roux, O.H.: Control and synthesis of non-interferent timed systems. Int. J. Control 88(2), 217\u2013236 (2015). https:\/\/doi.org\/10.1080\/00207179.2014.944356","DOI":"10.1080\/00207179.2014.944356"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-642-54830-7_2","volume-title":"Foundations of Software Science and Computation Structures","author":"N Bertrand","year":"2014","unstructured":"Bertrand, N., Fabre, \u00c9., Haar, S., Haddad, S., H\u00e9lou\u00ebt, L.: Active diagnosis for probabilistic systems. In: Muscholl, A. (ed.) FoSSaCS 2014. LNCS, vol. 8412, pp. 29\u201342. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54830-7_2"},{"key":"20_CR18","doi-asserted-by":"publisher","unstructured":"Bouyer, P., Fang, E., Markey, N.: Permissive strategies in timed automata and games. Electron. Commun. Eur. Assoc. Softw. Sci. Technolo. 72 (2015). https:\/\/doi.org\/10.14279\/tuj.eceasst.72.1015","DOI":"10.14279\/tuj.eceasst.72.1015"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-41036-9_1","volume-title":"Reachability Problems","author":"P Bouyer","year":"2013","unstructured":"Bouyer, P., Markey, N., Sankur, O.: Robustness in timed automata. In: Abdulla, P.A., Potapov, I. (eds.) RP 2013. LNCS, vol. 8169, pp. 1\u201318. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41036-9_1"},{"key":"20_CR20","doi-asserted-by":"publisher","unstructured":"Bruy\u00e8re, V., Dall\u2019Olio, E., Raskin, J.F.: Durations and parametric model-checking in timed automata. ACM Trans. Comput. Logic 9(2), 12:1\u201312:23 (2008). https:\/\/doi.org\/10.1145\/1342991.1342996","DOI":"10.1145\/1342991.1342996"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-02617-1_3","volume-title":"Advances in Information Security and Assurance","author":"F Cassez","year":"2009","unstructured":"Cassez, F.: The dark side of timed opacity. In: Park, J.H., Chen, H.-H., Atiquzzaman, M., Lee, C., Kim, T., Yeo, S.-S. (eds.) ISA 2009. LNCS, vol. 5576, pp. 21\u201330. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02617-1_3"},{"key":"20_CR22","doi-asserted-by":"publisher","unstructured":"Chen, A., Hong, C., Shang, X., Jing, H., Xu, S.: Timing leakage to break SM2 signature algorithm. J. Inf. Secur. Appl. 67, 103210 (2022). https:\/\/doi.org\/10.1016\/J.JISA.2022.103210","DOI":"10.1016\/J.JISA.2022.103210"},{"key":"20_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-30206-3_10","volume-title":"Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems","author":"M De Wulf","year":"2004","unstructured":"De Wulf, M., Doyen, L., Markey, N., Raskin, J.-F.: Robustness and implementability of timed automata. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS\/FTRTFT -2004. LNCS, vol. 3253, pp. 118\u2013133. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30206-3_10"},{"key":"20_CR24","doi-asserted-by":"publisher","unstructured":"Dima, C.: Real-time automata. J. Autom. Lang. Comb. 6(1), 3\u201323 (2001). https:\/\/doi.org\/10.25596\/jalc-2001-003","DOI":"10.25596\/jalc-2001-003"},{"key":"20_CR25","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. 4596, pp. 838\u2013849. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73420-8_72"},{"key":"20_CR26","doi-asserted-by":"publisher","unstructured":"Klein, J., Kogel, P., Glesner, S.: Verifying opacity of discrete-timed automata. In: FormaliSE, pp. 55\u201365. ACM (2024). https:\/\/doi.org\/10.1145\/3644033.3644376","DOI":"10.1145\/3644033.3644376"},{"issue":"2","key":"20_CR27","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1109\/TAC.2021.3064542","volume":"67","author":"J Li","year":"2022","unstructured":"Li, J., Lefebvre, D., Hadjicostis, C.N., Li, Z.: Observers for a class of timed automata based on elapsed time graphs. IEEE Trans. Autom. Control 67(2), 767\u2013779 (2022). https:\/\/doi.org\/10.1109\/TAC.2021.3064542","journal-title":"IEEE Trans. Autom. Control"},{"key":"20_CR28","doi-asserted-by":"publisher","unstructured":"Standaert, F.: Introduction to side-channel attacks. In: Verbauwhede, I. (ed.) Secure Integrated Circuits and Systems. Integrated Circuits and Systems, pp. 27\u201342. Springer, Boston (2010). https:\/\/doi.org\/10.1007\/978-0-387-71829-3_2","DOI":"10.1007\/978-0-387-71829-3_2"},{"issue":"1","key":"20_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/INCO.1994.1092","volume":"115","author":"MY Vardi","year":"1994","unstructured":"Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Inf. Comput. 115(1), 1\u201337 (1994). https:\/\/doi.org\/10.1006\/INCO.1994.1092","journal-title":"Inf. Comput."},{"key":"20_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-030-01461-2_3","volume-title":"Symposium on Real-Time and Hybrid Systems","author":"L Wang","year":"2018","unstructured":"Wang, L., Zhan, N.: Decidability of the initial-state opacity of real-time automata. In: Jones, C., Wang, J., Zhan, N. (eds.) Symposium on Real-Time and Hybrid Systems. LNCS, vol. 11180, pp. 44\u201360. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01461-2_3"},{"issue":"11","key":"20_CR31","doi-asserted-by":"publisher","first-page":"2845","DOI":"10.1109\/TCAD.2018.2857363","volume":"37","author":"L Wang","year":"2018","unstructured":"Wang, L., Zhan, N., An, J.: The opacity of real-time automata. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 37(11), 2845\u20132856 (2018). https:\/\/doi.org\/10.1109\/TCAD.2018.2857363","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"20_CR32","doi-asserted-by":"publisher","unstructured":"Zhang, K.: State-based opacity of labeled real-time automata. TCS 987, 114373 (2024). https:\/\/doi.org\/10.1016\/J.TCS.2023.114373","DOI":"10.1016\/J.TCS.2023.114373"}],"container-title":["Lecture Notes in Computer Science","Software Engineering and Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-77382-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T23:52:01Z","timestamp":1733097121000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-77382-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,26]]},"ISBN":["9783031773815","9783031773822"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-77382-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,26]]},"assertion":[{"value":"26 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Software Engineering and Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aveiro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sefm2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sefm-conference.github.io\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}