{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,23]],"date-time":"2025-11-23T20:57:12Z","timestamp":1763931432273,"version":"3.40.3"},"publisher-location":"Cham","reference-count":57,"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_11","type":"book-chapter","created":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T22:10:27Z","timestamp":1738361427000},"page":"220-234","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Learning Broadcast Protocols with\u00a0LeoParDS"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-1333-2490","authenticated-orcid":false,"given":"Noa","family":"Izsak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6015-4170","authenticated-orcid":false,"given":"Dana","family":"Fisman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9051-4050","authenticated-orcid":false,"given":"Swen","family":"Jacobs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,1]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-662-44584-6_9","volume-title":"CONCUR 2014 \u2013 Concurrency Theory","author":"B Aminof","year":"2014","unstructured":"Aminof, B., Kotek, T., Rubin, S., Spegni, F., Veith, H.: Parameterized model checking of rendezvous systems. In: Baldan, P., Gorla, D. (eds.) CONCUR 2014. LNCS, vol. 8704, pp. 109\u2013124. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44584-6_9"},{"issue":"2","key":"11_CR2","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":"11_CR3","unstructured":"Angluin, D., Antonopoulos, T., Fisman, D.: Query learning of derived $$\\omega $$ tree languages in polynomial time. Log. Methods Comput. Sci. 15(3) (2019)"},{"key":"11_CR4","unstructured":"Angluin, D., Antonopoulos, T., Fisman, D.: Strongly unambiguous b\u00fcchi automata are polynomially predictable with membership queries. In: 28th EACSL Annual Conference on Computer Science Logic, CSL 2020, pp. 8:1\u20138:17 (2020)"},{"key":"11_CR5","unstructured":"Angluin, D., Eisenstat, S., Fisman, D.: Learning regular languages via alternating automata. In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, pp. 3308\u20133314 (2015)"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2016.07.031","volume":"650","author":"D Angluin","year":"2016","unstructured":"Angluin, D., Fisman, D.: Learning regular omega languages. Theor. Comput. Sci. 650, 57\u201372 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-319-96145-3_23","volume-title":"Computer Aided Verification","author":"G Argyros","year":"2018","unstructured":"Argyros, G., D\u2019Antoni, L.: The learnability of symbolic automata. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 427\u2013445. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96145-3_23"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-23021-4_1","volume-title":"Algebraic Informatics","author":"B Balle","year":"2015","unstructured":"Balle, B., Mohri, M.: Learning weighted automata. In: Maletti, A. (ed.) CAI 2015. LNCS, vol. 9270, pp. 1\u201321. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23021-4_1"},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1145\/337244.337257","volume":"47","author":"A Beimel","year":"2000","unstructured":"Beimel, A., Bergadano, F., Bshouty, N.H., Kushilevitz, E., Varricchio, S.: Learning functions represented as multiplicity automata. J. ACM 47(3), 506\u2013530 (2000)","journal-title":"J. ACM"},{"issue":"6","key":"11_CR10","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1109\/TC.1972.5009015","volume":"21","author":"AW Biermann","year":"1972","unstructured":"Biermann, A.W., Feldman, J.A.: On the synthesis of finite-state machines from samples of their behavior. IEEE Trans. Comput. 21(6), 592\u2013597 (1972)","journal-title":"IEEE Trans. Comput."},{"key":"11_CR11","unstructured":"Bohn, L., L\u00f6ding, C.: Constructing deterministic $$\\omega $$-automata from examples by an extension of the RPNI algorithm. In: 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, pp. 20:1\u201320:18 (2021)"},{"key":"11_CR12","unstructured":"Bollig, B., Habermehl, P., Kern, C., Leucker, M.: Angluin-style learning of NFA. In: IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, 2009, pp. 1004\u20131009 (2009)"},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1109\/TSE.2009.89","volume":"36","author":"B Bollig","year":"2010","unstructured":"Bollig, B., Katoen, J., Kern, C., Leucker, M.: Learning communicating automata from MSCs. IEEE Trans. Software Eng. 36(3), 390\u2013408 (2010)","journal-title":"IEEE Trans. Software Eng."},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-642-14295-6_32","volume-title":"Computer Aided Verification","author":"B Bollig","year":"2010","unstructured":"Bollig, B., Katoen, J.-P., Kern, C., Leucker, M., Neider, D., Piegdon, D.R.: libalf: the Automata Learning Framework. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 360\u2013364. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14295-6_32"},{"key":"11_CR15","unstructured":"Boutilier, C.: Planning, learning and coordination in multiagent decision processes. In: TARK, vol.\u00a096, pp. 195\u2013210. Citeseer (1996)"},{"issue":"2","key":"11_CR16","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00165-016-0355-5","volume":"28","author":"S Cassel","year":"2016","unstructured":"Cassel, S., Howar, F., Jonsson, B., Steffen, B.: Active learning for extended finite state machines. Formal Aspects Comput. 28(2), 233\u2013263 (2016). https:\/\/doi.org\/10.1007\/s00165-016-0355-5","journal-title":"Formal Aspects Comput."},{"issue":"3","key":"11_CR17","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/csla.1998.0045","volume":"12","author":"A Castellanos","year":"1998","unstructured":"Castellanos, A., Vidal, E., Var\u00f3, M.A., Oncina, J.: Language understanding and subsequential transducer learning. Comput. Speech Lang. 12(3), 193\u2013228 (1998)","journal-title":"Comput. Speech Lang."},{"issue":"2","key":"11_CR18","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"EM Clarke","year":"1986","unstructured":"Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Program. Lang. Syst. 8(2), 244\u2013263 (1986). https:\/\/doi.org\/10.1145\/5397.5399","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"11_CR19","unstructured":"Delzanno, G., Sangnier, A., Traverso, R., Zavattaro, G.: On the complexity of parameterized reachability in reconfigurable broadcast networks. In: FSTTCS. LIPIcs, vol.\u00a018, pp. 289\u2013300. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2012)"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-44693-1_13","volume-title":"STACS 2001","author":"F Denis","year":"2001","unstructured":"Denis, F., Lemay, A., Terlutte, A.: Residual finite state automata. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 144\u2013157. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44693-1_13"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"28573","DOI":"10.1109\/ACCESS.2018.2831228","volume":"6","author":"A Dorri","year":"2018","unstructured":"Dorri, A., Kanhere, S.S., Jurdak, R.: Multi-agent systems: a survey. IEEE Access 6, 28573\u201328593 (2018). https:\/\/doi.org\/10.1109\/ACCESS.2018.2831228","journal-title":"IEEE Access"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/10721959_19","volume-title":"Automated Deduction - CADE-17","author":"EA Emerson","year":"2000","unstructured":"Emerson, E.A., Kahlon, V.: Reducing model checking of the many to the few. In: McAllester, D. (ed.) CADE 2000. LNCS (LNAI), vol. 1831, pp. 236\u2013254. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10721959_19"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-61474-5_60","volume-title":"Computer Aided Verification","author":"EA Emerson","year":"1996","unstructured":"Emerson, E.A., Namjoshi, K.S.: Automatic verification of parameterized synchronous systems. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 87\u201398. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61474-5_60"},{"issue":"3\u20134","key":"11_CR24","doi-asserted-by":"publisher","first-page":"205","DOI":"10.3233\/FI-2011-607","volume":"113","author":"J Esparza","year":"2011","unstructured":"Esparza, J., Leucker, M., Schlund, M.: Learning workflow petri nets. Fundam. Informaticae 113(3\u20134), 205\u2013228 (2011)","journal-title":"Fundam. Informaticae"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-78800-3_2","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Farzan","year":"2008","unstructured":"Farzan, A., Chen, Y.-F., Clarke, E.M., Tsay, Y.-K., Wang, B.-Y.: Extending\u00a0automated\u00a0compositional\u00a0verification to the full class of omega-regular languages. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 2\u201317. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_2"},{"key":"11_CR26","volume-title":"Multi-agent Systems: An introduction to Distributed Artificial Intelligence","author":"J Ferber","year":"1999","unstructured":"Ferber, J., Weiss, G.: Multi-agent Systems: An introduction to Distributed Artificial Intelligence, vol. 1. Addison-Wesley, Reading (1999)"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Fisman, D., Frenkel, H., Zilles, S.: Inferring symbolic automata. Log. Methods Comput. Sci. 19(2) (2023)","DOI":"10.46298\/lmcs-19(2:5)2023"},{"key":"11_CR28","doi-asserted-by":"publisher","unstructured":"Fisman, D., Izsak, N., Jacobs, S.: Learning broadcast protocols. Proc. AAAI Conf. Artif. Intell. 38(11), 12016\u201312023 (2024). https:\/\/doi.org\/10.1609\/aaai.v38i11.29089, https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/29089","DOI":"10.1609\/aaai.v38i11.29089"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Fisman, D., Nitay, D., Ziv-Ukelson, M.: Learning of structurally unambiguous probabilistic grammars. Log. Methods Comput. Sci. 19(1) (2023)","DOI":"10.46298\/lmcs-19(1:10)2023"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Fisman, D., Saadon, S.: Learning and characterizing fully-ordered lattice automata. In: Automated Technology for Verification and Analysis - 20th International Symposium, ATVA 2022, Proceedings, pp. 266\u2013282 (2022)","DOI":"10.1007\/978-3-031-19992-9_17"},{"key":"11_CR31","doi-asserted-by":"publisher","unstructured":"George, N.: ALMA: automata learner using modulo 2 multiplicity automata. CoRR abs\/2301.04077 (2023). https:\/\/doi.org\/10.48550\/ARXIV.2301.04077","DOI":"10.48550\/ARXIV.2301.04077"},{"issue":"3","key":"11_CR32","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1145\/146637.146681","volume":"39","author":"SM German","year":"1992","unstructured":"German, S.M., Sistla, A.P.: Reasoning about systems with many processes. J. ACM 39(3), 675\u2013735 (1992)","journal-title":"J. ACM"},{"issue":"3","key":"11_CR33","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)","journal-title":"Inf. Control"},{"key":"11_CR34","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/11814771_40","volume-title":"Automated Reasoning","author":"O Grinchtein","year":"2006","unstructured":"Grinchtein, O., Leucker, M., Piterman, N.: Inferring network invariants automatically. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 483\u2013497. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11814771_40"},{"key":"11_CR35","unstructured":"Hack, M.: Decidability questions for Petri Nets. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, USA (1976)"},{"key":"11_CR36","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-642-15488-1_7","volume-title":"Grammatical Inference: Theoretical Results and Applications","author":"MJH Heule","year":"2010","unstructured":"Heule, M.J.H., Verwer, S.: Exact DFA identification using SAT solvers. In: Sempere, J.M., Garc\u00eda, P. (eds.) ICGI 2010. LNCS (LNAI), vol. 6339, pp. 66\u201379. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15488-1_7"},{"issue":"2","key":"11_CR37","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1007353007695","volume":"27","author":"C de la Higuera","year":"1997","unstructured":"de la Higuera, C.: Characteristic sets for polynomial grammatical inference. Mach. Learn. 27(2), 125\u2013138 (1997)","journal-title":"Mach. Learn."},{"key":"11_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-642-27940-9_17","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"F Howar","year":"2012","unstructured":"Howar, F., Steffen, B., Jonsson, B., Cassel, S.: Inferring canonical register automata. In: Kuncak, V., Rybalchenko, A. (eds.) VMCAI 2012. LNCS, vol. 7148, pp. 251\u2013266. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27940-9_17"},{"key":"11_CR39","doi-asserted-by":"crossref","unstructured":"Isberner, M., Howar, F., Steffen, B.: The TTT algorithm: a redundancy-free approach to active automata learning. In: Runtime Verification - 5th International Conference, RV 2014. Proceedings, pp. 307\u2013322 (2014)","DOI":"10.1007\/978-3-319-11164-3_26"},{"key":"11_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-319-21690-4_32","volume-title":"Computer Aided Verification","author":"M Isberner","year":"2015","unstructured":"Isberner, M., Howar, F., Steffen, B.: The open-source LearnLib. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 487\u2013495. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_32"},{"key":"11_CR41","doi-asserted-by":"publisher","unstructured":"Jos\u00e9\u00a0Oncina, P.G.: Identifying regular languages in polynomial time. In: Advances in Structural and Syntactic Pattern Recognition, pp. 99\u2013108 (1992). https:\/\/doi.org\/10.1142\/9789812797919_0007","DOI":"10.1142\/9789812797919_0007"},{"key":"11_CR42","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/3897.001.0001","volume-title":"An Introduction to Computational Learning Theory","author":"MJ Kearns","year":"1994","unstructured":"Kearns, M.J., Vazirani, U.V.: An Introduction to Computational Learning Theory. MIT Press, Cambridge (1994)"},{"key":"11_CR43","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/3-540-47745-4_7","volume-title":"Multi-Agent Systems and Applications","author":"S Kraus","year":"2001","unstructured":"Kraus, S.: Automated negotiation and decision making in multiagent environments. In: Luck, M., Ma\u0159\u00edk, V., \u0160t\u011bp\u00e1nkov\u00e1, O., Trappl, R. (eds.) ACAI 2001. LNCS (LNAI), vol. 2086, pp. 150\u2013172. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-47745-4_7"},{"key":"11_CR44","doi-asserted-by":"publisher","unstructured":"Li, Y., Chen, Y.F., Zhang, L., Liu, D.: A novel learning algorithm for b\u00fcchi automata based on family of DFAs and classification trees. Inf. Comput. 281, 104678 (2021). https:\/\/doi.org\/10.1016\/j.ic.2020.104678, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0890540120301711","DOI":"10.1016\/j.ic.2020.104678"},{"issue":"2","key":"11_CR45","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1006\/inco.1995.1070","volume":"118","author":"O Maler","year":"1995","unstructured":"Maler, O., Pnueli, A.: On the learnability of infinitary regular sets. Inf. Comput. 118(2), 316\u2013326 (1995)","journal-title":"Inf. Comput."},{"key":"11_CR46","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103710","volume":"307","author":"J Michaliszyn","year":"2022","unstructured":"Michaliszyn, J., Otop, J.: Learning infinite-word automata with loop-index queries. Artif. Intell. 307, 103710 (2022)","journal-title":"Artif. Intell."},{"key":"11_CR47","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":"11_CR48","doi-asserted-by":"crossref","unstructured":"Muscholl, A., Walukiewicz, I.: Active learning for sound negotiations. In: LICS \u201922: 37th Annual ACM\/IEEE Symposium on Logic in Computer Science, 2022, pp. 21:1\u201321:12 (2022)","DOI":"10.1145\/3531130.3533342"},{"key":"11_CR49","doi-asserted-by":"crossref","unstructured":"Neider, D., Gavran, I.: Learning linear temporal properties. In: 2018 Formal Methods in Computer Aided Design, FMCAD 2018, pp. 1\u201310 (2018)","DOI":"10.23919\/FMCAD.2018.8603016"},{"issue":"1\/2","key":"11_CR50","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1023\/A:1010828029885","volume":"44","author":"AL Oliveira","year":"2001","unstructured":"Oliveira, A.L., Silva, J.P.M.: Efficient algorithms for the inference of minimum size DFAs. Mach. Learn. 44(1\/2), 93\u2013119 (2001)","journal-title":"Mach. Learn."},{"key":"11_CR51","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","volume":"6","author":"C Rackoff","year":"1978","unstructured":"Rackoff, C.: The covering and boundedness problems for vector addition systems. Theor. Comput. Sci. 6, 223\u2013231 (1978)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"11_CR52","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":"11_CR53","doi-asserted-by":"publisher","unstructured":"Roy, R., Fisman, D., Neider, D.: Learning interpretable models in the property specification language. In: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020. pp. 2213\u20132219 (2020). https:\/\/doi.org\/10.24963\/ijcai.2020\/306","DOI":"10.24963\/ijcai.2020\/306"},{"issue":"9","key":"11_CR54","doi-asserted-by":"publisher","first-page":"1372","DOI":"10.1016\/j.patcog.2004.03.021","volume":"38","author":"Y Sakakibara","year":"2005","unstructured":"Sakakibara, Y.: Learning context-free grammars using tabular representations. Pattern Recognit. 38(9), 1372\u20131383 (2005)","journal-title":"Pattern Recognit."},{"key":"11_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-642-40184-8_2","volume-title":"CONCUR 2013 \u2013 Concurrency Theory","author":"S Schmitz","year":"2013","unstructured":"Schmitz, S., Schnoebelen, P.: The power of well-structured systems. In: D\u2019Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013. LNCS, vol. 8052, pp. 5\u201324. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40184-8_2"},{"key":"11_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-030-99524-9_12","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"F Vaandrager","year":"2022","unstructured":"Vaandrager, F., Garhewal, B., Rot, J., Wi\u00dfmann, T.: A new approach for active automata learning based on apartness. In: TACAS 2022. LNCS, vol. 13243, pp. 223\u2013243. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99524-9_12"},{"key":"11_CR57","volume-title":"Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence","author":"G Weiss","year":"1999","unstructured":"Weiss, G.: Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence. MIT Press, Cambridge (1999)"}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T22:10:53Z","timestamp":1738361453000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78709-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031787089","9783031787096"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78709-6_11","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"}}]}}