{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T16:10:53Z","timestamp":1746115853845,"version":"3.40.4"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031908965"},{"type":"electronic","value":"9783031908972"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"vor","delay-in-days":120,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Alternating timed automata (ATA) are an extension of timed automata, that are closed under complementation and hence amenable to logic-to-automata translations. Several timed logics, including Metric Temporal Logic (MTL), can be converted to equivalent 1-clock ATAs (1-ATAs). Satisfiability of an MTL formula reduces to checking emptiness of a 1-ATA. Furthermore, algorithms for 1-ATA emptiness can be adapted for model-checking timed automata models against 1-ATA specifications. However, existing emptiness algorithms for 1-ATA proceed by an extended region construction, and are not suitable for implementations.<\/jats:p>\n          <jats:p>In this work, we initiate the study of zone-based methods for 1-ATAs. The challenge here, as opposed to timed automata, is the fact that the zone graph may generate an unbounded number of variables. We first introduce a <jats:italic>deactivation operation<\/jats:italic> to the 1-ATA syntax that allows for an explicit deactivation of the clock in transitions. Using the deactivation operation, we improve the existing MTL-to-1-ATA conversion and present a fragment of MTL for which the equivalent 1-ATA generate a bounded number of variables. Secondly, we develop the idea of zones for 1-ATA and present an emptiness algorithm which explores a corresponding zone graph. For termination, a special entailment check between zones is necessary. Our main technical contributions are: (1) an algorithm for the entailment check using simple zone operations and (2) an <jats:inline-formula>\n              <jats:tex-math>$$\\textsf{NP}$$<\/jats:tex-math>\n            <\/jats:inline-formula>-hardness for the entailment check in the general case. Finally, for 1-ATA which generate a bounded number of variables, we present a modified entailment check with quadratic complexity.<\/jats:p>","DOI":"10.1007\/978-3-031-90897-2_19","type":"book-chapter","created":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T08:18:57Z","timestamp":1746001137000},"page":"399-421","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Model-Checking Real-Time Systems: Revisiting the Alternating Automaton Route"],"prefix":"10.1007","author":[{"given":"Patricia","family":"Bouyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Srivathsan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vaishnavi","family":"Vishwanath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,1]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Ouaknine, J., Quaas, K., Worrell, J.: Zone-based universality analysis for single-clock timed automata. In: International Conference on Fundamentals of Software Engineering. pp. 98\u2013112. Springer (2007)","key":"19_CR1","DOI":"10.1007\/978-3-540-75698-9_7"},{"doi-asserted-by":"publisher","unstructured":"Akshay, S., Gastin, P., Govind, R., Joshi, A.R., Srivathsan, B.: A unified model for real-time systems: Symbolic techniques and implementation. In: Enea, C., Lal, A. (eds.) Computer Aided Verification - 35th International Conference, CAV 2023, Paris, France, July 17-22, 2023, Proceedings, Part I. Lecture Notes in Computer Science, vol. 13964, pp. 266\u2013288. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-37706-8_14, https:\/\/doi.org\/10.1007\/978-3-031-37706-8_14","key":"19_CR2","DOI":"10.1007\/978-3-031-37706-8_14"},{"doi-asserted-by":"publisher","unstructured":"Akshay, S., Gastin, P., Govind, R., Srivathsan, B.: MITL model checking via generalized timed automata and a new liveness algorithm. In: Majumdar, R., Silva, A. (eds.) 35th International Conference on Concurrency Theory, CONCUR 2024, September 9-13, 2024, Calgary, Canada. LIPIcs, vol.\u00a0311, pp. 5:1\u20135:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPICS.CONCUR.2024.5, https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2024.5","key":"19_CR3","DOI":"10.4230\/LIPICS.CONCUR.2024.5"},{"doi-asserted-by":"crossref","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theoretical computer science 126(2), 183\u2013235 (1994)","key":"19_CR4","DOI":"10.1016\/0304-3975(94)90010-8"},{"doi-asserted-by":"crossref","unstructured":"Alur, R., Feder, T., Henzinger, T.A.: The benefits of relaxing punctuality. Journal of the ACM (JACM) 43(1), 116\u2013146 (1996)","key":"19_CR5","DOI":"10.1145\/227595.227602"},{"doi-asserted-by":"crossref","unstructured":"Alur, R., Fix, L., Henzinger, T.A.: Event-clock automata: A determinizable class of timed automata. Theoretical Computer Science 211(1-2), 253\u2013273 (1999)","key":"19_CR6","DOI":"10.1016\/S0304-3975(97)00173-4"},{"doi-asserted-by":"publisher","unstructured":"Behrmann, G., Bouyer, P., Larsen, K.G., Pel\u00e1nek, R.: Lower and upper bounds in zone-based abstractions of timed automata. Int. J. Softw. Tools Technol. Transf. 8(3), 204\u2013215 (2006). https:\/\/doi.org\/10.1007\/S10009-005-0190-0, https:\/\/doi.org\/10.1007\/s10009-005-0190-0","key":"19_CR7","DOI":"10.1007\/S10009-005-0190-0"},{"doi-asserted-by":"publisher","unstructured":"Behrmann, G., David, A., Larsen, K.G.: A tutorial on uppaal. In: Bernardo, M., Corradini, F. (eds.) Formal Methods for the Design of Real-Time Systems, International School on Formal Methods for the Design of Computer, Communication and Software Systems, SFM-RT 2004, Bertinoro, Italy, September 13-18, 2004, Revised Lectures. Lecture Notes in Computer Science, vol.\u00a03185, pp. 200\u2013236. Springer (2004). https:\/\/doi.org\/10.1007\/978-3-540-30080-9_7, https:\/\/doi.org\/10.1007\/978-3-540-30080-9_7","key":"19_CR8","DOI":"10.1007\/978-3-540-30080-9_7"},{"doi-asserted-by":"publisher","unstructured":"Bouyer, P.: Forward analysis of updatable timed automata. Formal Methods Syst. Des. 24(3), 281\u2013320 (2004). https:\/\/doi.org\/10.1023\/B:FORM.0000026093.21513.31, https:\/\/doi.org\/10.1023\/B:FORM.0000026093.21513.31","key":"19_CR9","DOI":"10.1023\/B:FORM.0000026093.21513.31"},{"doi-asserted-by":"publisher","unstructured":"Bouyer, P., Gastin, P., Herbreteau, F., Sankur, O., Srivathsan, B.: Zone-based verification of timed automata: Extrapolations, simulations and what next? In: Bogomolov, S., Parker, D. (eds.) Formal Modeling and Analysis of Timed Systems - 20th International Conference, FORMATS 2022, Warsaw, Poland, September 13-15, 2022, Proceedings. Lecture Notes in Computer Science, vol. 13465, pp. 16\u201342. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-15839-1_2, https:\/\/doi.org\/10.1007\/978-3-031-15839-1_2","key":"19_CR10","DOI":"10.1007\/978-3-031-15839-1_2"},{"doi-asserted-by":"crossref","unstructured":"Bouyer, P., Markey, N., Ouaknine, J., Worrell, J.: The cost of punctuality. In: 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007). pp. 109\u2013120. IEEE (2007)","key":"19_CR11","DOI":"10.1109\/LICS.2007.49"},{"unstructured":"Bouyer, P., Srivathsan, B., Vishwanath, V.: Model-checking real-time systems: revisiting the alternating automaton route (2025), https:\/\/arxiv.org\/abs\/2501.17576","key":"19_CR12"},{"doi-asserted-by":"crossref","unstructured":"Brihaye, T., Esti\u00e9venart, M., Geeraerts, G.: On mitl and alternating timed automata. In: Formal Modeling and Analysis of Timed Systems: 11th International Conference, FORMATS 2013, Buenos Aires, Argentina, August 29-31, 2013. Proceedings 11. pp. 47\u201361. Springer (2013)","key":"19_CR13","DOI":"10.1007\/978-3-642-40229-6_4"},{"doi-asserted-by":"publisher","unstructured":"Brihaye, T., Geeraerts, G., Ho, H., Monmege, B.: Mightyl: A compositional translation from MITL to timed automata. In: Majumdar, R., Kuncak, V. (eds.) Computer Aided Verification - 29th International Conference, CAV 2017, Heidelberg, Germany, July 24-28, 2017, Proceedings, Part I. Lecture Notes in Computer Science, vol. 10426, pp. 421\u2013440. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-63387-9_21, https:\/\/doi.org\/10.1007\/978-3-319-63387-9_21","key":"19_CR14","DOI":"10.1007\/978-3-319-63387-9_21"},{"doi-asserted-by":"publisher","unstructured":"Daws, C., Tripakis, S.: Model checking of real-time reachability properties using abstractions. In: Steffen, B. (ed.) Tools and Algorithms for Construction and Analysis of Systems, 4th International Conference, TACAS \u201998, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS\u201998, Lisbon, Portugal, March 28 - April 4, 1998, Proceedings. Lecture Notes in Computer Science, vol.\u00a01384, pp. 313\u2013329. Springer (1998). https:\/\/doi.org\/10.1007\/BFB0054180, https:\/\/doi.org\/10.1007\/BFb0054180","key":"19_CR15","DOI":"10.1007\/BFB0054180"},{"doi-asserted-by":"publisher","unstructured":"Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) Automatic Verification Methods for Finite State Systems, International Workshop, Grenoble, France, June 12-14, 1989, Proceedings. Lecture Notes in Computer Science, vol.\u00a0407, pp. 197\u2013212. Springer (1989). https:\/\/doi.org\/10.1007\/3-540-52148-8_17, https:\/\/doi.org\/10.1007\/3-540-52148-8_17","key":"19_CR16","DOI":"10.1007\/3-540-52148-8_17"},{"doi-asserted-by":"crossref","unstructured":"Doyen, L., Raskin, J.: Antichains for the automata-based approach to model-checking. Log. Methods Comput. Sci. 5(1) (2009), http:\/\/arxiv.org\/abs\/0902.3958","key":"19_CR17","DOI":"10.2168\/LMCS-5(1:5)2009"},{"doi-asserted-by":"publisher","unstructured":"Doyen, L., Raskin, J.: Antichain algorithms for finite automata. In: Esparza, J., Majumdar, R. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, 16th International Conference, TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings. Lecture Notes in Computer Science, vol.\u00a06015, pp. 2\u201322. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-12002-2_2, https:\/\/doi.org\/10.1007\/978-3-642-12002-2_2","key":"19_CR18","DOI":"10.1007\/978-3-642-12002-2_2"},{"doi-asserted-by":"publisher","unstructured":"Fiedor, T., Hol\u00edk, L., Hruska, M., Rogalewicz, A., S\u00edc, J., Vargovc\u00edk, P.: Reasoning about regular properties: A comparative study. In: Pientka, B., Tinelli, C. (eds.) Automated Deduction - CADE 29 - 29th International Conference on Automated Deduction, Rome, Italy, July 1-4, 2023, Proceedings. Lecture Notes in Computer Science, vol. 14132, pp. 286\u2013306. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-38499-8_17, https:\/\/doi.org\/10.1007\/978-3-031-38499-8_17","key":"19_CR19","DOI":"10.1007\/978-3-031-38499-8_17"},{"unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)","key":"19_CR20"},{"doi-asserted-by":"publisher","unstructured":"Gastin, P., Mukherjee, S., Srivathsan, B.: Reachability in Timed Automata with Diagonal Constraints. In: Schewe, S., Zhang, L. (eds.) 29th International Conference on Concurrency Theory (CONCUR 2018). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0118, pp. 28:1\u201328:17. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2018). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2018.28, http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2018\/9566","key":"19_CR21","DOI":"10.4230\/LIPIcs.CONCUR.2018.28"},{"unstructured":"Herbreteau, F., Point, G.: TChecker. https:\/\/github.com\/fredher\/tchecker (v02 - April 2019)","key":"19_CR22"},{"doi-asserted-by":"crossref","unstructured":"Herbreteau, F., Srivathsan, B., Walukiewicz, I.: Better abstractions for timed automata. Information and Computation 251, 67\u201390 (2016)","key":"19_CR23","DOI":"10.1016\/j.ic.2016.07.004"},{"doi-asserted-by":"publisher","unstructured":"Hol\u00edk, L., Vargovc\u00edk, P.: Antichain with SAT and tries. In: Chakraborty, S., Jiang, J.R. (eds.) 27th International Conference on Theory and Applications of Satisfiability Testing, SAT 2024, August 21-24, 2024, Pune, India. LIPIcs, vol.\u00a0305, pp. 15:1\u201315:24. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPICS.SAT.2024.15, https:\/\/doi.org\/10.4230\/LIPIcs.SAT.2024.15","key":"19_CR24","DOI":"10.4230\/LIPICS.SAT.2024.15"},{"doi-asserted-by":"crossref","unstructured":"Kant, G., Laarman, A., Meijer, J., van\u00a0de Pol, J., Blom, S., van Dijk, T.: LTSmin: High-performance language-independent model checking. In: TACAS. Lecture Notes in Computer Science, vol.\u00a09035, pp. 692\u2013707. Springer (2015)","key":"19_CR25","DOI":"10.1007\/978-3-662-46681-0_61"},{"doi-asserted-by":"publisher","unstructured":"Krishna, S.N., Madnani, K., Pandya, P.K.: Logics meet 1-clock alternating timed automata. In: Schewe, S., Zhang, L. (eds.) 29th International Conference on Concurrency Theory, CONCUR 2018, September 4-7, 2018, Beijing, China. LIPIcs, vol.\u00a0118, pp. 39:1\u201339:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPICS.CONCUR.2018.39, https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2018.39","key":"19_CR26","DOI":"10.4230\/LIPICS.CONCUR.2018.39"},{"doi-asserted-by":"publisher","unstructured":"Kruskal, J.B.: The theory of well-quasi-ordering: A frequently discovered concept. Journal of Combinatorial Theory, Series A 13(3), 297\u2013305 (1972). https:\/\/doi.org\/10.1016\/0097-3165(72)90063-5, https:\/\/www.sciencedirect.com\/science\/article\/pii\/0097316572900635","key":"19_CR27","DOI":"10.1016\/0097-3165(72)90063-5"},{"doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. STTT 1(1-2), 134\u2013152 (1997)","key":"19_CR28","DOI":"10.1007\/s100090050010"},{"doi-asserted-by":"crossref","unstructured":"Lasota, S., Walukiewicz, I.: Alternating timed automata. In: International Conference on Foundations of Software Science and Computation Structures. pp. 250\u2013265. Springer (2005)","key":"19_CR29","DOI":"10.1007\/978-3-540-31982-5_16"},{"doi-asserted-by":"publisher","unstructured":"Lasota, S., Walukiewicz, I.: Alternating timed automata. ACM Trans. Comput. Log. 9(2), 10:1\u201310:27 (2008). https:\/\/doi.org\/10.1145\/1342991.1342994, https:\/\/doi.org\/10.1145\/1342991.1342994","key":"19_CR30","DOI":"10.1145\/1342991.1342994"},{"doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: On the language inclusion problem for timed automata: Closing a decidability gap. In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004. pp. 54\u201363. IEEE (2004)","key":"19_CR31","DOI":"10.1109\/LICS.2004.1319600"},{"doi-asserted-by":"publisher","unstructured":"Ouaknine, J., Worrell, J.: On the decidability of metric temporal logic. In: 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 26-29 June 2005, Chicago, IL, USA, Proceedings. pp. 188\u2013197. IEEE Computer Society (2005). https:\/\/doi.org\/10.1109\/LICS.2005.33, https:\/\/doi.org\/10.1109\/LICS.2005.33","key":"19_CR32","DOI":"10.1109\/LICS.2005.33"},{"doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: On the decidability and complexity of metric temporal logic over finite words. Logical Methods in Computer Science 3 (2007)","key":"19_CR33","DOI":"10.2168\/LMCS-3(1:8)2007"},{"doi-asserted-by":"publisher","unstructured":"Srivathsan, B.: Reachability in timed automata. ACM SIGLOG News 9(3), 6\u201328 (2022). https:\/\/doi.org\/10.1145\/3559736.3559738, https:\/\/doi.org\/10.1145\/3559736.3559738","key":"19_CR34","DOI":"10.1145\/3559736.3559738"},{"doi-asserted-by":"crossref","unstructured":"Sun, J., Liu, Y., Dong, J.S., Pang, J.: PAT: Towards flexible verification under fairness. Lecture Notes in Computer Science, vol.\u00a05643, pp. 709\u2013714. Springer (2009)","key":"19_CR35","DOI":"10.1007\/978-3-642-02658-4_59"},{"doi-asserted-by":"publisher","unstructured":"T\u00f3th, T., Hajdu, A., V\u00f6r\u00f6s, A., Micskei, Z., Majzik, I.: Theta: a framework for abstraction refinement-based model checking. In: Stewart, D., Weissenbacher, G. (eds.) Proceedings of the 17th Conference on Formal Methods in Computer-Aided Design. pp. 176\u2013179 (2017). https:\/\/doi.org\/10.23919\/FMCAD.2017.8102257","key":"19_CR36","DOI":"10.23919\/FMCAD.2017.8102257"},{"doi-asserted-by":"publisher","unstructured":"Vargovc\u00edk, P., Hol\u00edk, L.: Simplifying alternating automata for emptiness testing. In: Oh, H. (ed.) Programming Languages and Systems - 19th Asian Symposium, APLAS 2021, Chicago, IL, USA, October 17-18, 2021, Proceedings. Lecture Notes in Computer Science, vol. 13008, pp. 243\u2013264. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-89051-3_14, https:\/\/doi.org\/10.1007\/978-3-030-89051-3_14","key":"19_CR37","DOI":"10.1007\/978-3-030-89051-3_14"},{"doi-asserted-by":"publisher","unstructured":"Wulf, M.D., Doyen, L., Henzinger, T.A., Raskin, J.: Antichains: A new algorithm for checking universality of finite automata. In: Ball, T., Jones, R.B. (eds.) Computer Aided Verification, 18th International Conference, CAV 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings. Lecture Notes in Computer Science, vol.\u00a04144, pp. 17\u201330. Springer (2006). https:\/\/doi.org\/10.1007\/11817963_5, https:\/\/doi.org\/10.1007\/11817963_5","key":"19_CR38","DOI":"10.1007\/11817963_5"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-90897-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T08:19:14Z","timestamp":1746001154000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-90897-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031908965","9783031908972"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-90897-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoSSaCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hamilton, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2025\/conferences\/fossacs\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}