{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T22:41:30Z","timestamp":1761432090853,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032087065"},{"type":"electronic","value":"9783032087072"}],"license":[{"start":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T00:00:00Z","timestamp":1761436800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T00:00:00Z","timestamp":1761436800000},"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-08707-2_2","type":"book-chapter","created":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T22:33:22Z","timestamp":1761431602000},"page":"27-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning Event-Recording Automata Passively"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4793-1892","authenticated-orcid":false,"given":"Anirban","family":"Majumdar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6473-3172","authenticated-orcid":false,"given":"Sayan","family":"Mukherjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3673-1097","authenticated-orcid":false,"given":"Jean-Fran\u00e7ois","family":"Raskin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,26]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., et al.: Syntax-guided synthesis. In: Formal Methods in Computer-Aided Design, FMCAD 2013, Portland, OR, USA, 20\u201323 October 2013, pp.\u00a01\u20138. IEEE (2013). https:\/\/ieeexplore.ieee.org\/document\/6679385\/","DOI":"10.1109\/FMCAD.2013.6679385"},{"issue":"2","key":"2_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. Theor. Comput. Sci. 126(2), 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"2_CR3","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/227595.227602","volume":"43","author":"R Alur","year":"1996","unstructured":"Alur, R., Feder, T., Henzinger, T.A.: The benefits of relaxing punctuality. J. ACM 43(1), 116\u2013146 (1996)","journal-title":"J. ACM"},{"issue":"1\u20132","key":"2_CR4","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. Theor. Comput. Sci. 211(1\u20132), 253\u2013273 (1999)","journal-title":"Theor. Comput. Sci."},{"issue":"9","key":"2_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-019-2767-4","volume":"64","author":"J An","year":"2021","unstructured":"An, J., Wang, L., Zhan, B., Zhan, N., Zhang, M.: Learning real-time automata. Sci. China Inf. Sci. 64(9), 1\u201317 (2021). https:\/\/doi.org\/10.1007\/s11432-019-2767-4","journal-title":"Sci. China Inf. Sci."},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Balachander, M., Filiot, E., Raskin, J.: LTL reactive synthesis with a few hints. In: TACAS (2). Lecture Notes in Computer Science, vol. 13994, pp. 309\u2013328. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30820-8_20","DOI":"10.1007\/978-3-031-30820-8_20"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Bruy\u00e8re, V., Garhewal, B., P\u00e9rez, G.A., Staquet, G., Vaandrager, F.W.: Active learning of mealy machines with timers. CoRR arxiv:2403.02019 (2024)","DOI":"10.1007\/978-3-032-05792-1_3"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: STOC, pp. 151\u2013158. ACM (1971)","DOI":"10.1145\/800157.805047"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Cornanguer, L., Largou\u00ebt, C., Roz\u00e9, L., Termier, A.: TAG: learning timed automata from logs. In: AAAI, pp. 3949\u20133958. AAAI Press (2022)","DOI":"10.1609\/aaai.v36i4.20311"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Dupont, P.: Incremental regular inference. In: ICGI. Lecture Notes in Computer Science, vol.\u00a01147, pp. 222\u2013237. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/978-3-031-30820-8_20","DOI":"10.1007\/978-3-031-30820-8_20"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Gold, E.M.: Language identification in the limit. Inf. Control. 10(5), 447\u2013474 (1967). https:\/\/doi.org\/10.1016\/S0019-9958(67)91165-5","DOI":"10.1016\/S0019-9958(67)91165-5"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Gold, E.M.: Complexity of automaton identification from given data. Inf. Control. 37(3), 302\u2013320 (1978). https:\/\/doi.org\/10.1016\/S0019-9958(78)90562-4","DOI":"10.1016\/S0019-9958(78)90562-4"},{"issue":"47","key":"2_CR13","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. Theor. Comput. Sci. 411(47), 4029\u20134054 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR14","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":"2_CR15","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"},{"issue":"1","key":"2_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/382294.382725","volume":"15","author":"H Holbrook","year":"1990","unstructured":"Holbrook, H.: A scenario-based methodology for conducting requirements elicitation. ACM SIGSOFT Softw. Eng. Notes 15(1), 95\u2013104 (1990)","journal-title":"ACM SIGSOFT Softw. Eng. Notes"},{"issue":"1\u20132","key":"2_CR17","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/s100090050010","volume":"1","author":"KG Larsen","year":"1997","unstructured":"Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. Int. J. Softw. Tools Technol. Transf. 1(1\u20132), 134\u2013152 (1997)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-24372-1_35","volume-title":"Automated Technology for Verification and Analysis","author":"S-W Lin","year":"2011","unstructured":"Lin, S.-W., Andr\u00e9, \u00c9., Dong, J.S., Sun, J., Liu, Y.: An efficient algorithm for learning event-recording automata. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 463\u2013472. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24372-1_35"},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Majumdar, A., Mukherjee, S., Raskin, J.: Greybox learning of languages recognizable by event-recording automata. In: ATVA. Lecture Notes in Computer Science, vol. 15054, pp. 235\u2013256. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-78709-6_12","DOI":"10.1007\/978-3-031-78709-6_12"},{"key":"2_CR20","unstructured":"Majumdar, A., Mukherjee, S., Raskin, J.F.: Learning event-recording automata passively (2025). https:\/\/arxiv.org\/abs\/2508.03627"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Oncina, J., Garcia, P.: Inferring regular languages in polynomial updated time. In: Pattern Recognition and Image Analysis: Selected Papers from the IVth Spanish Symposium, pp. 49\u201361. World Scientific (1992)","DOI":"10.1142\/9789812797902_0004"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Pastore, F., Micucci, D., Mariani, L.: Timed k-tail: automatic inference of timed automata. In: ICST, pp. 401\u2013411. IEEE Computer Society (2017)","DOI":"10.1109\/ICST.2017.43"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Tappler, M., Aichernig, B.K., Larsen, K.G., Lorber, F.: Time to learn - learning timed automata from tests. In: FORMATS. Lecture Notes in Computer Science, vol. 11750, pp. 216\u2013235. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-29662-9_13","DOI":"10.1007\/978-3-030-29662-9_13"},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"Tappler, M., Aichernig, B.K., Lorber, F.: Timed automata learning via SMT solving. In: NFM. Lecture Notes in Computer Science, vol. 13260, pp. 489\u2013507. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-06773-0_26","DOI":"10.1007\/978-3-031-06773-0_26"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Teng, Y., Zhang, M., An, J.: Learning deterministic multi-clock timed automata. In: HSCC, pp. 6:1\u20136:11. ACM (2024)","DOI":"10.1145\/3641513.3650124"},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"Vaandrager, F.W.: Model learning. Commun. ACM 60(2), 86\u201395 (2017). https:\/\/doi.org\/10.1145\/2967606","DOI":"10.1145\/2967606"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Vaandrager, F.W., Ebrahimi, M., Bloem, R.: Learning mealy machines with one timer. Inf. Comput. 295(Part B), 105013 (2023)","DOI":"10.1016\/j.ic.2023.105013"},{"key":"2_CR28","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: TACAS (1). Lecture Notes in Computer Science, vol. 13243, pp. 223\u2013243. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-030-99524-9_12","DOI":"10.1007\/978-3-030-99524-9_12"},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-540-88009-7_19","volume-title":"Grammatical Inference: Algorithms and Applications","author":"S Verwer","year":"2008","unstructured":"Verwer, S., Weerdt, M., Witteveen, C.: Polynomial distinguishability of timed automata. In: Clark, A., Coste, F., Miclet, L. (eds.) ICGI 2008. LNCS (LNAI), vol. 5278, pp. 238\u2013251. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88009-7_19"},{"key":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1007\/978-3-642-00982-2_63","volume-title":"Language and Automata Theory and Applications","author":"S Verwer","year":"2009","unstructured":"Verwer, S., Weerdt, M., Witteveen, C.: One-clock deterministic timed automata are efficiently identifiable in the limit. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 740\u2013751. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00982-2_63"},{"key":"2_CR31","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-15488-1_17","volume-title":"Grammatical Inference: Theoretical Results and Applications","author":"S Verwer","year":"2010","unstructured":"Verwer, S., Weerdt, M., Witteveen, C.: A likelihood-ratio test for identifying probabilistic deterministic real-time automata from positive data. In: Sempere, J.M., Garc\u00eda, P. (eds.) ICGI 2010. LNCS (LNAI), vol. 6339, pp. 203\u2013216. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15488-1_17"},{"key":"2_CR32","doi-asserted-by":"publisher","unstructured":"Waga, M.: Active learning of deterministic timed automata with myhill-nerode style characterization. In: CAV (1). Lecture Notes in Computer Science, vol. 13964, pp. 3\u201326. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-37706-8_1","DOI":"10.1007\/978-3-031-37706-8_1"},{"key":"2_CR33","doi-asserted-by":"publisher","unstructured":"Xu, R., An, J., Zhan, B.: Active learning of one-clock timed automata using constraint solving. In: ATVA. Lecture Notes in Computer Science, vol. 13505, pp. 249\u2013265. Springer, Heidelberg (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","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-08707-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T22:33:35Z","timestamp":1761431615000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-08707-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,26]]},"ISBN":["9783032087065","9783032087072"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-08707-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,10,26]]},"assertion":[{"value":"26 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bengaluru","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"27 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/atva-2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}