{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:41:10Z","timestamp":1759365670123,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032057914","type":"print"},{"value":"9783032057921","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:00:00Z","timestamp":1759363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:00:00Z","timestamp":1759363200000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-05792-1_3","type":"book-chapter","created":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T10:31:43Z","timestamp":1759314703000},"page":"42-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Active Learning of\u00a0Mealy Machines with\u00a0Timers"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9680-9140","authenticated-orcid":false,"given":"V\u00e9ronique","family":"Bruy\u00e8re","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4908-2863","authenticated-orcid":false,"given":"Bharat","family":"Garhewal","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1200-4952","authenticated-orcid":false,"given":"Guillermo A.","family":"P\u00e9rez","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5795-3265","authenticated-orcid":false,"given":"Ga\u00ebtan","family":"Staquet","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3955-1910","authenticated-orcid":false,"given":"Frits W.","family":"Vaandrager","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,2]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-55754-6_1","volume-title":"NASA Formal Methods","author":"BK Aichernig","year":"2020","unstructured":"Aichernig, B.K., Pferscher, A., Tappler, M.: From passive to active: learning timed automata efficiently. In: Lee, R., Jha, S., Mavridou, A., Giannakopoulou, D. (eds.) NFM 2020. LNCS, vol. 12229, pp. 1\u201319. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-55754-6_1"},{"issue":"2","key":"3_CR2","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. Theoret. Comput. Sci. 126(2), 183\u2013235 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90010-8","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"3_CR3","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. Theoret. Comput. Sci. 211(1\u20132), 253\u2013273 (1999). https:\/\/doi.org\/10.1016\/S0304-3975(97)00173-4","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-030-45190-5_25","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J An","year":"2020","unstructured":"An, J., Chen, M., Zhan, B., Zhan, N., Zhang, M.: Learning one-clock timed automata. In: TACAS 2020. LNCS, vol. 12078, pp. 444\u2013462. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45190-5_25"},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87\u2013106 (1987). https:\/\/doi.org\/10.1016\/0890-5401(87)90052-6","journal-title":"Inf. Comput."},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-31585-5_12","volume-title":"Automata, Languages, and Programming","author":"M Boja\u0144czyk","year":"2012","unstructured":"Boja\u0144czyk, M., Lasota, S.: A machine-independent characterization of timed languages. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7392, pp. 92\u2013103. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31585-5_12"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Bruy\u00e8re, V., Garhewal, B., P\u00e9rez, G.A., Staquet, G., Vaandrager, F.W.: Active Learning of Mealy Machines with Timers. CoRR abs\/2403.02019 (2024). https:\/\/doi.org\/10.48550\/ARXIV.2403.02019","DOI":"10.48550\/ARXIV.2403.02019"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Bruy\u00e8re, V., P\u00e9rez, G.A., Staquet, G., Vaandrager, F.W.: Automata with timers. In: Petrucci, L., Sproston, J. (eds.) Proceedings of the 21st International Conference Formal Modeling and Analysis of Timed Systems, FORMATS 2023. LNCS, vol. 14138, pp. 33\u201349. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-42626-1_3","DOI":"10.1007\/978-3-031-42626-1_3"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R. (eds.): Handbook of Model Checking. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8","DOI":"10.1007\/978-3-319-10575-8"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Dierl, S., et al.: Learning symbolic timed models from concrete timed data. In: Rozier, K.Y., Chaudhuri, S. (eds.) Proceedings of the 15th International Symposium NASA Formal Methods, NFM 2023. LNCS, vol. 13903, pp. 104\u2013121. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-33170-1_7","DOI":"10.1007\/978-3-031-33170-1_7"},{"key":"3_CR11","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). https:\/\/doi.org\/10.1007\/3-540-52148-8_17"},{"key":"3_CR12","doi-asserted-by":"publisher","unstructured":"Doveri, K., Ganty, P., Srivathsan, B.: A Myhill-Nerode style characterization for timed automata with integer resets. In: Barman, S., Lasota, S. (eds.) 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2024, 16\u201318 December 2024, Gandhinagar, Gujarat, India. LIPIcs, vol.\u00a0323, pp. 21:1\u201321:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPICS.FSTTCS.2024.21","DOI":"10.4230\/LIPICS.FSTTCS.2024.21"},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Ferreira, T., Brewton, H., D\u2019Antoni, L., Silva, A.: Prognosis: closed-box analysis of network protocol implementations. In: Kuipers, F.A., Caesar, M.C. (eds.) Proceedings of the ACM SIGCOMM 2021 Conference, pp. 762\u2013774. ACM (2021). https:\/\/doi.org\/10.1145\/3452296.3472938","DOI":"10.1145\/3452296.3472938"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-319-67113-0_12","volume-title":"Critical Systems: Formal Methods and Automated Verification","author":"P Fiter\u0103u-Bro\u015ftean","year":"2017","unstructured":"Fiter\u0103u-Bro\u015ftean, P., Howar, F.: Learning-based testing the sliding window behavior of TCP implementations. In: Petrucci, L., Seceleanu, C., Cavalcanti, A. (eds.) FMICS\/AVoCS -2017. LNCS, vol. 10471, pp. 185\u2013200. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67113-0_12"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-319-41540-6_25","volume-title":"Computer Aided Verification","author":"P Fiter\u0103u-Bro\u015ftean","year":"2016","unstructured":"Fiter\u0103u-Bro\u015ftean, P., Janssen, R., Vaandrager, F.: Combining model learning and model checking to analyze TCP implementations. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9780, pp. 454\u2013471. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41540-6_25"},{"key":"3_CR16","unstructured":"Fiterau-Brostean, P., Jonsson, B., Merget, R., de\u00a0Ruiter, J., Sagonas, K., Somorovsky, J.: Analysis of DTLS implementations using protocol state fuzzing. In: Capkun, S., Roesner, F. (eds.) Proceedings of the 29th USENIX Security Symposium, USENIX Security 2020, pp. 2523\u20132540. USENIX Association (2020). https:\/\/www.usenix.org\/conference\/usenixsecurity20\/presentation\/fiterau-brostean"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Fiterau-Brostean, P., Lenaerts, T., Poll, E., de\u00a0Ruiter, J., Vaandrager, F.W., Verleg, P.: Model learning and model checking of SSH implementations. In: Erdogmus, H., Havelund, K. (eds.) Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, pp. 142\u2013151. ACM (2017). https:\/\/doi.org\/10.1145\/3092282.3092289","DOI":"10.1145\/3092282.3092289"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Garhewal, B.: L# MMT artifact (2024). https:\/\/doi.org\/10.5281\/ZENODO.10647627. https:\/\/zenodo.org\/doi\/10.5281\/zenodo.10647627","DOI":"10.5281\/ZENODO.10647627"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-030-63461-2_2","volume-title":"Integrated Formal Methods","author":"B Garhewal","year":"2020","unstructured":"Garhewal, B., Vaandrager, F., Howar, F., Schrijvers, T., Lenaerts, T., Smits, R.: Grey-box learning of register automata. In: Dongol, B., Troubitsyna, E. (eds.) IFM 2020. LNCS, vol. 12546, pp. 22\u201340. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-63461-2_2"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-540-30206-3_26","volume-title":"Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems","author":"O Grinchtein","year":"2004","unstructured":"Grinchtein, O., Jonsson, B., Leucker, M.: Learning of event-recording automata. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS\/FTRTFT -2004. LNCS, vol. 3253, pp. 379\u2013395. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30206-3_26"},{"issue":"47","key":"3_CR21","doi-asserted-by":"publisher","first-page":"4029","DOI":"10.1016\/J.TCS.2010.07.008","volume":"411","author":"O Grinchtein","year":"2010","unstructured":"Grinchtein, O., Jonsson, B., Leucker, M.: Learning of event-recording automata. Theoret. Comput. Sci. 411(47), 4029\u20134054 (2010). https:\/\/doi.org\/10.1016\/J.TCS.2010.07.008","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/11817949_29","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"O Grinchtein","year":"2006","unstructured":"Grinchtein, O., Jonsson, B., Pettersson, P.: Inference of event-recording automata using timed decision trees. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 435\u2013449. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11817949_29"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-030-57628-8_9","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"L Henry","year":"2020","unstructured":"Henry, L., J\u00e9ron, T., Markey, N.: Active learning of timed automata with unobservable resets. In: Bertrand, N., Jansen, N. (eds.) FORMATS 2020. LNCS, vol. 12288, pp. 144\u2013160. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57628-8_9"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-96562-8_5","volume-title":"Machine Learning for Dynamic Software Analysis: Potentials and Limits","author":"F Howar","year":"2018","unstructured":"Howar, F., Steffen, B.: Active automata learning in practice. In: Bennaceur, A., H\u00e4hnle, R., Meinke, K. (eds.) Machine Learning for Dynamic Software Analysis: Potentials and Limits. LNCS, vol. 11026, pp. 123\u2013148. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96562-8_5"},{"issue":"6","key":"3_CR25","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1109\/TCOM.1987.1096832","volume":"35","author":"MJ Johnson","year":"1987","unstructured":"Johnson, M.J.: Proof that timing requirements of the FDDI token ring protocol are satisfied. IEEE Trans. Comput. 35(6), 620\u2013625 (1987). https:\/\/doi.org\/10.1109\/TCOM.1987.1096832","journal-title":"IEEE Trans. Comput."},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Kogel, P., Kl\u00f6s, V., Glesner, S.: Learning mealy machines with local timers. In: Li, Y., Tahar, S. (eds.) Proceedings of the 24th International Conference on Formal Engineering Methods Formal Methods and Software Engineering, ICFEM 2023. LNCS, vol. 14308, pp. 47\u201364. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-981-99-7584-6_4","DOI":"10.1007\/978-981-99-7584-6_4"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-540-24727-2_25","volume-title":"Foundations of Software Science and Computation Structures","author":"O Maler","year":"2004","unstructured":"Maler, O., Pnueli, A.: On recognizable timed languages. In: Walukiewicz, I. (ed.) FoSSaCS 2004. LNCS, vol. 2987, pp. 348\u2013362. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24727-2_25"},{"key":"3_CR28","unstructured":"de\u00a0Ruiter, J., Poll, E.: Protocol state fuzzing of TLS implementations. In: Jung, J., Holz, T. (eds.) Proceedings of the 24th USENIX Security Symposium, USENIX Security 2015, pp. 193\u2013206. USENIX Association (2015). https:\/\/www.usenix.org\/conference\/usenixsecurity15\/technical-sessions\/presentation\/de-ruiter"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-05089-3_14","volume-title":"FM 2009: Formal Methods","author":"M Shahbaz","year":"2009","unstructured":"Shahbaz, M., Groz, R.: Inferring mealy machines. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol. 5850, pp. 207\u2013222. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-05089-3_14"},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-030-29662-9_13","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"M Tappler","year":"2019","unstructured":"Tappler, M., Aichernig, B.K., Larsen, K.G., Lorber, F.: Time to learn \u2013 learning timed automata from tests. In: Andr\u00e9, \u00c9., Stoelinga, M. (eds.) FORMATS 2019. LNCS, vol. 11750, pp. 216\u2013235. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29662-9_13"},{"issue":"2","key":"3_CR31","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/2967606","volume":"60","author":"FW Vaandrager","year":"2017","unstructured":"Vaandrager, F.W.: Model learning. Commun. ACM 60(2), 86\u201395 (2017). https:\/\/doi.org\/10.1145\/2967606","journal-title":"Commun. ACM"},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-030-68195-1_13","volume-title":"Language and Automata Theory and Applications","author":"F Vaandrager","year":"2021","unstructured":"Vaandrager, F., Bloem, R., Ebrahimi, M.: Learning mealy machines with one timer. In: Leporati, A., Mart\u00edn-Vide, C., Shapira, D., Zandron, C. (eds.) LATA 2021. LNCS, vol. 12638, pp. 157\u2013170. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-68195-1_13"},{"key":"3_CR33","doi-asserted-by":"publisher","unstructured":"Vaandrager, F.W., Garhewal, B., Rot, J., Wi\u00dfmann, T.: A new approach for active automata learning based on apartness. In: Fisman, D., Rosu, G. (eds.) Proceedings of the 28th International Conference Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2022. LNCS, vol. 13243, pp. 223\u2013243. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99524-9_12","DOI":"10.1007\/978-3-030-99524-9_12"},{"key":"3_CR34","doi-asserted-by":"publisher","unstructured":"Waga, M.: Active learning of deterministic timed automata with Myhill-Nerode style characterization. In: Enea, C., Lal, A. (eds.) Proceedings of the 35th International Conference Computer Aided Verification, CAV 2023. LNCS, vol. 13964, pp. 3\u201326. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-37706-8_1","DOI":"10.1007\/978-3-031-37706-8_1"},{"key":"3_CR35","doi-asserted-by":"publisher","unstructured":"Xu, R., An, J., Zhan, B.: Active learning of one-clock timed automata using constraint solving. In: Bouajjani, A., Hol\u00edk, L., Wu, Z. (eds.) Proceedings of the 20th International Symposium Automated Technology for Verification and Analysis, ATVA 2022. LNCS, vol. 13505, pp. 249\u2013265. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-19992-9_16","DOI":"10.1007\/978-3-031-19992-9_16"}],"container-title":["Lecture Notes in Computer Science","Quantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-05792-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T10:31:44Z","timestamp":1759314704000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-05792-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,2]]},"ISBN":["9783032057914","9783032057921"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-05792-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,2]]},"assertion":[{"value":"2 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"QEST+FORMATS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Quantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","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":"26 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"qest2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.qest-formats.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}