{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T15:27:55Z","timestamp":1781018875538,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T00:00:00Z","timestamp":1774224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["BisoUS (ANR-22-CE48-0012)"],"award-info":[{"award-number":["BisoUS (ANR-22-CE48-0012)"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018833","name":"Agence de l'innovation de D\u00e9fense","doi-asserted-by":"publisher","award":["CHRoMM"],"award-info":[{"award-number":["CHRoMM"]}],"id":[{"id":"10.13039\/501100018833","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,3,23]]},"DOI":"10.1145\/3748522.3779881","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T14:17:49Z","timestamp":1781014669000},"page":"317-324","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Opacity problems in multi-energy timed automata"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8473-9555","authenticated-orcid":false,"given":"\u00c9tienne","family":"Andr\u00e9","sequence":"first","affiliation":[{"name":"LS2N, CNRS, Nantes Universit\u00e9, Nantes, Bretagne, France"},{"name":"Institut Universitaire de France, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-8655-6455","authenticated-orcid":false,"given":"Lydia","family":"Bakiri","sequence":"additional","affiliation":[{"name":"LIPN, CNRS, Universit\u00e9 Sorbonne Paris Nord, Villetaneuse, France"},{"name":"LIX, CNRS, \u00c9cole polytechnique, Institut Polytechnique de Paris, Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"LNCS","volume-title":"Hybrid Systems","author":"Alur R.","year":"1992","unstructured":"R. Alur, C. Courcoubetis, T. A. Henzinger, and P.-H. Ho. Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems. In Hybrid Systems 1992, volume 736 of LNCS. Springer, 1993."},{"key":"e_1_3_2_1_2_1","volume-title":"A theory of timed automata. TCS, 126(2)","author":"Alur R.","year":"1994","unstructured":"R. Alur and D. L. Dill. A theory of timed automata. TCS, 126(2), 1994."},{"key":"e_1_3_2_1_3_1","first-page":"61","author":"Ammar I.","year":"2021","unstructured":"I. Ammar, Y. El Touati, M. Yeddes, and J. Mullins. Bounded opacity for timed systems. Journal of Information Security and Applications, 61, 2021.","journal-title":"Journal of Information Security and Applications"},{"key":"e_1_3_2_1_4_1","series-title":"LNCS","volume-title":"FM","author":"An J.","year":"2024","unstructured":"J. An, Q. Gao, L. Wang, N. Zhan, and I. Hasuo. The opacity of timed automata. In FM, volume 14933 of LNCS. Springer, 2024."},{"key":"e_1_3_2_1_5_1","series-title":"LIPIcs","volume-title":"FSTTCS","author":"Arcile J.","year":"2024","unstructured":"\u00c9. Andr\u00e9, J. Arcile, and E. Lefaucheux. Execution-time opacity problems in one-clock parametric timed automata. In FSTTCS, volume 323 of LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2024."},{"key":"e_1_3_2_1_6_1","unstructured":"\u00c9. Andr\u00e9 and L. Bakiri. Opacity problems in multi-energy timed automata. Technical Report abs\/2512.04950 arXiv 2025."},{"key":"e_1_3_2_1_7_1","volume-title":"FTSCS. ACM","author":"Bolat S.","year":"2022","unstructured":"\u00c9. Andr\u00e9, S. Bolat, E. Lefaucheux, and D. Marinho. strategFTO: Untimed control for timed opacity. In FTSCS. ACM, 2022."},{"key":"e_1_3_2_1_8_1","series-title":"LNCS","volume-title":"SEFM","author":"Duflot-Kr\u00e9mer M.","year":"2024","unstructured":"\u00c9. Andr\u00e9, M. Duflot-Kr\u00e9mer, L. Laversa, and E. Lefaucheux. Execution-time opacity control for timed automata. In SEFM, volume 15280 of LNCS. Springer, 2024."},{"key":"e_1_3_2_1_9_1","series-title":"LNCS","volume-title":"ICFEM","author":"D\u00e9pernet S.","year":"2024","unstructured":"\u00c9. Andr\u00e9, S. D\u00e9pernet, and E. Lefaucheux. The bright side of timed opacity. In ICFEM, volume 15394 of LNCS. Springer, 2024."},{"key":"e_1_3_2_1_10_1","volume-title":"ICECCS","author":"Kryukov A.","year":"2020","unstructured":"\u00c9. Andr\u00e9 and A. Kryukov. Parametric non-interference in timed automata. In ICECCS, 2020."},{"key":"e_1_3_2_1_11_1","series-title":"Electronic Proceedings in Theoretical Computer Science","volume-title":"TiCSA","author":"Lefaucheux E.","year":"2023","unstructured":"\u00c9. Andr\u00e9, E. Lefaucheux, D. Lime, D. Marinho, and J. Sun. Configuring timing parameters to ensure execution-time opacity in timed automata. In TiCSA, volume 392 of Electronic Proceedings in Theoretical Computer Science, 2023. Invited paper."},{"key":"e_1_3_2_1_12_1","volume-title":"Timed automata as a formalism for expressing security: A survey on theory and practice. ACM Computing Surveys, 55(6)","author":"Arcile J.","year":"2023","unstructured":"J. Arcile and \u00c9. Andr\u00e9. Timed automata as a formalism for expressing security: A survey on theory and practice. ACM Computing Surveys, 55(6), 2023."},{"key":"e_1_3_2_1_13_1","volume-title":"Optimal and robust controller synthesis using energy timed automata with uncertainty. FAC, 33(1)","author":"Bacci G.","year":"2021","unstructured":"G. Bacci, P. Bouyer, U. Fahrenberg, K. G. Larsen, N. Markey, and P.-A. Reynier. Optimal and robust controller synthesis using energy timed automata with uncertainty. FAC, 33(1), 2021."},{"key":"e_1_3_2_1_14_1","volume-title":"A notion of non-interference for timed automata. FI, 51(1\u20132)","author":"Barbuti R.","year":"2002","unstructured":"R. Barbuti, N. D. Francesco, A. Santone, and L. Tesei. A notion of non-interference for timed automata. FI, 51(1\u20132), 2002."},{"key":"e_1_3_2_1_15_1","volume-title":"A decidable notion of timed non-interference. FI, 54(2\u20133)","author":"Barbuti R.","year":"2003","unstructured":"R. Barbuti and L. Tesei. A decidable notion of timed non-interference. FI, 54(2\u20133), 2003."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.7146\/brics.v8i3.20457"},{"key":"e_1_3_2_1_17_1","volume-title":"Optimal scheduling using priced timed automata. SIGMETRICS Performance Evaluation Review, 32(4)","author":"Behrmann G.","year":"2005","unstructured":"G. Behrmann, K. G. Larsen, and J. I. Rasmussen. Optimal scheduling using priced timed automata. SIGMETRICS Performance Evaluation Review, 32(4), 2005."},{"issue":"2","key":"e_1_3_2_1_18_1","volume":"88","author":"Benattar G.","year":"2015","unstructured":"G. Benattar, F. Cassez, D. Lime, and O. H. Roux. Control and synthesis of non-interferent timed systems. International Journal of Control, 88(2), 2015.","journal-title":"Control and synthesis of non-interferent timed systems. International Journal of Control"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85778-5_4"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-008-0058-x"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02617-1_3"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-64626-3_5"},{"key":"e_1_3_2_1_23_1","unstructured":"W. Deng D. Qiu and J. Yang. New insights into the decidability of opacity in timed automata. Technical Report abs\/2504.00625 arXiv 2025."},{"key":"e_1_3_2_1_24_1","volume-title":"Non-interference control synthesis for security timed automata. ENTCS, 180(1)","author":"Gardey G.","year":"2007","unstructured":"G. Gardey, J. Mullins, and O. H. Roux. Non-interference control synthesis for security timed automata. ENTCS, 180(1), 2007."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3644033.3644376"},{"key":"e_1_3_2_1_26_1","volume-title":"Parikh images of grammars: Complexity and applications","author":"Kopczy\u0144ski E.","year":"2010","unstructured":"E. Kopczy\u0144ski and A. W. To. Parikh images of grammars: Complexity and applications. In LiCS. IEEE Computer Society, 2010."},{"key":"e_1_3_2_1_27_1","first-page":"45","author":"Lafortune S.","year":"2018","unstructured":"S. Lafortune, F. Lin, and C. N. Hadjicostis. On the history of diagnosability and opacity in discrete event systems. Annual Reviews in Control, 45, 2018.","journal-title":"Annual Reviews in Control"},{"issue":"2","key":"e_1_3_2_1_28_1","volume":"67","author":"Li J.","year":"2022","unstructured":"J. Li, D. Lefebvre, C. N. Hadjicostis, and Z. Li. Observers for a class of timed automata based on elapsed time graphs. IEEE Transactions on Automatic Control, 67(2), 2022.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"e_1_3_2_1_29_1","volume-title":"WITS","author":"Mazar\u00e9 L.","year":"2004","unstructured":"L. Mazar\u00e9. Using unification for opacity properties. In WITS, 2004."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/321356.321364"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-42626-1_8"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01461-2_3"},{"issue":"11","key":"e_1_3_2_1_33_1","volume":"37","author":"Wang L.","year":"2018","unstructured":"L. Wang, N. Zhan, and J. An. The opacity of real-time automata. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 37(11), 2018.","journal-title":"The opacity of real-time automata. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"e_1_3_2_1_34_1","first-page":"987","author":"Zhang K.","year":"2024","unstructured":"K. Zhang. State-based opacity of labeled real-time automata. TCS, 987, 2024.","journal-title":"TCS"}],"event":{"name":"SAC '26: 41st ACM\/SIGAPP Symposium on Applied Computing","location":"Grand Hotel Palace Thessaloniki Greece","acronym":"SAC '26","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"]},"container-title":["Proceedings of the 41st ACM\/SIGAPP Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3748522.3779881","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T14:39:47Z","timestamp":1781015987000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3748522.3779881"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,23]]},"references-count":34,"alternative-id":["10.1145\/3748522.3779881","10.1145\/3748522"],"URL":"https:\/\/doi.org\/10.1145\/3748522.3779881","relation":{},"subject":[],"published":{"date-parts":[[2026,3,23]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}