{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:24:48Z","timestamp":1743063888598,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031787089"},{"type":"electronic","value":"9783031787096"}],"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:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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-78709-6_12","type":"book-chapter","created":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T22:10:35Z","timestamp":1738361435000},"page":"235-256","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Greybox Learning of\u00a0Languages Recognizable by\u00a0Event-Recording Automata"],"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,2,1]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-319-40648-0_21","volume-title":"NASA Formal Methods","author":"A Abel","year":"2016","unstructured":"Abel, A., Reineke, J.: Gray-box learning of serial compositions of mealy machines. In: Rayadurgam, S., Tkachuk, O. (eds.) NFM 2016. LNCS, vol. 9690, pp. 272\u2013287. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40648-0_21"},{"issue":"2","key":"12_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\u20132","key":"12_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. Theor. Comput. Sci. 211(1\u20132), 253\u2013273 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"An, J., Wang, L., Zhan, B., Zhan, N., Zhang, M.: Learning real-time automata. Sci. China Inf. Sci. 64(9) (2021)","DOI":"10.1007\/s11432-019-2767-4"},{"issue":"2","key":"12_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)","journal-title":"Inf. Comput."},{"key":"12_CR6","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":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-00768-2_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Y-F Chen","year":"2009","unstructured":"Chen, Y.-F., Farzan, A., Clarke, E.M., Tsay, Y.-K., Wang, B.-Y.: Learning minimal separating DFA\u2019s for compositional verification. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 31\u201345. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00768-2_3"},{"key":"12_CR8","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":"12_CR9","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"},{"issue":"3","key":"12_CR10","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"EM Gold","year":"1978","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","journal-title":"Inf. Control"},{"issue":"47","key":"12_CR11","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":"12_CR12","unstructured":"Herbreteau, F., Point, G.: Tchecker. https:\/\/github.com\/ticktac-project\/tchecker"},{"key":"12_CR13","unstructured":"Isberner, M., Steffen, B.: An abstract framework for counterexample analysis in active automata learning. In: ICGI. JMLR Workshop and Conference Proceedings, vol.\u00a034, pp. 79\u201393. JMLR.org (2014)"},{"key":"12_CR14","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":"12_CR15","unstructured":"Majumdar, A., Mukherjee, S., Raskin, J.F.: Greybox learning of languages recognizable by event-recording automata (2024). https:\/\/arxiv.org\/abs\/2408.12551"},{"key":"12_CR16","unstructured":"Moeller, M., Wiener, T., Solko-Breslin, A., Koch, C., Foster, N., Silva, A.: Automata learning with an incomplete teacher. In: ECOOP. LIPIcs, vol.\u00a0263, pp. 21:1\u201321:30. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11334-022-00449-3","volume":"18","author":"E Mu\u0161kardin","year":"2022","unstructured":"Mu\u0161kardin, E., Aichernig, B., Pill, I., Pferscher, A., Tappler, M.: AALpy: an active automata learning library. Innovations Syst. Softw. Eng. 18, 1\u201310 (2022). https:\/\/doi.org\/10.1007\/s11334-022-00449-3","journal-title":"Innovations Syst. Softw. Eng."},{"issue":"2","key":"12_CR19","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1006\/inco.1993.1021","volume":"103","author":"RL Rivest","year":"1993","unstructured":"Rivest, R.L., Schapire, R.E.: Inference of finite automata using homing sequences. Inf. Comput. 103(2), 299\u2013347 (1993)","journal-title":"Inf. Comput."},{"key":"12_CR20","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"},{"key":"12_CR21","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"},{"issue":"2","key":"12_CR22","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)","journal-title":"Commun. ACM"},{"key":"12_CR23","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":"12_CR24","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., de 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":"12_CR25","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-37706-8_1","volume-title":"CAV 2023","author":"M Waga","year":"2023","unstructured":"Waga, M.: Active learning of deterministic timed automata with Myhill-Nerode style characterization. In: Enea, C., Lal, A. (eds.) CAV 2023. LNCS, vol. 13964, pp. 3\u201326. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-37706-8_1"},{"key":"12_CR26","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-031-19992-9_16","volume-title":"ATVA 2022","author":"R Xu","year":"2022","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.) ATVA 2022. LNCS, vol. 13505, pp. 249\u2013265. Springer, Cham (2022). https:\/\/doi.org\/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-031-78709-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T22:10:40Z","timestamp":1738361440000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78709-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031787089","9783031787096"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78709-6_12","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 February 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":"Kyoto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"21 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}