{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T20:14:49Z","timestamp":1784837689737,"version":"3.55.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032087065","type":"print"},{"value":"9783032087072","type":"electronic"}],"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_1","type":"book-chapter","created":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T22:33:37Z","timestamp":1761431617000},"page":"3-26","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Componentwise Automata Learning for\u00a0System Integration"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-0794-5743","authenticated-orcid":false,"given":"Hiroya","family":"Fujinami","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9360-7490","authenticated-orcid":false,"given":"Masaki","family":"Waga","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9260-9697","authenticated-orcid":false,"given":"Jie","family":"An","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7466-8789","authenticated-orcid":false,"given":"Kohei","family":"Suenaga","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nayuta","family":"Yanagisawa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hiroki","family":"Iseri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8300-4650","authenticated-orcid":false,"given":"Ichiro","family":"Hasuo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,10,26]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Babai, L. (ed.) Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, 13\u201316 June 2004, pp. 202\u2013211. ACM (2004). https:\/\/doi.org\/10.1145\/1007352.1007390","DOI":"10.1145\/1007352.1007390"},{"issue":"2","key":"1_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). https:\/\/doi.org\/10.1016\/0890-5401(87)90052-6","journal-title":"Inf. Comput."},{"key":"1_CR3","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":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-68270-9_7","volume-title":"ModelEd, TestEd, TrustEd","author":"A Bainczyk","year":"2017","unstructured":"Bainczyk, A., Schieweck, A., Steffen, B., Howar, F.: Model-based testing without models: the\u00a0TodoMVC case study. In: Katoen, J.-P., Langerak, R., Rensink, A. (eds.) ModelEd, TestEd, TrustEd. LNCS, vol. 10500, pp. 125\u2013144. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68270-9_7"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-662-54577-5_10","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Drews","year":"2017","unstructured":"Drews, S., D\u2019Antoni, L.: Learning symbolic automata. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10205, pp. 173\u2013189. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54577-5_10"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"al\u00a0Duhaiby, O., Groote, J.F.: Active learning of decomposable systems. In: Bae, K., Bianculli, D., Gnesi, S., Plat, N. (eds.) FormaliSE@ICSE 2020: 8th International Conference on Formal Methods in Software Engineering, Seoul, Republic of Korea, 13 July 2020, pp. 1\u201310. ACM (2020). https:\/\/doi.org\/10.1145\/3372020.3391560","DOI":"10.1145\/3372020.3391560"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Fisman, D., Frenkel, H., Zilles, S.: Inferring symbolic automata. Log. Methods Comput. Sci. 19(2) (2023). https:\/\/doi.org\/10.46298\/LMCS-19(2:5)2023","DOI":"10.46298\/LMCS-19(2:5)2023"},{"issue":"4","key":"1_CR8","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/S10009-021-00634-Y","volume":"23","author":"M Frohme","year":"2021","unstructured":"Frohme, M., Steffen, B.: Compositional learning of mutually recursive procedural systems. Int. J. Softw. Tools Technol. Transf. 23(4), 521\u2013543 (2021). https:\/\/doi.org\/10.1007\/S10009-021-00634-Y","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Fujinami, H., Waga, M., Hasuo, I.: Artifact archive for \u201ccomponentwise automata learning for system integration\" (2025). https:\/\/doi.org\/10.5281\/zenodo.15846781","DOI":"10.5281\/zenodo.15846781"},{"key":"1_CR10","unstructured":"Fujinami, H., et al.: Componentwise automata learning for system integration (extended version) (2025). https:\/\/arxiv.org\/abs\/2508.04458"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/978-3-030-45231-5_31","volume-title":"Foundations of Software Science and Computation Structures","author":"G Heerdt","year":"2020","unstructured":"Heerdt, G., Kupke, C., Rot, J., Silva, A.: Learning weighted automata over principal ideal domains. In: FoSSaCS 2020. LNCS, vol. 12077, pp. 602\u2013621. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45231-5_31"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-319-11164-3_26","volume-title":"Runtime Verification","author":"M Isberner","year":"2014","unstructured":"Isberner, M., Howar, F., Steffen, B.: The TTT algorithm: a redundancy-free approach to active automata learning. In: Bonakdarpour, B., Smolka, S.A. (eds.) RV 2014. LNCS, vol. 8734, pp. 307\u2013322. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11164-3_26"},{"key":"1_CR13","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":"1_CR14","unstructured":"Isberner, M., Steffen, B.: An abstract framework for counterexample analysis in active automata learning. In: Clark, A., Kanazawa, M., Yoshinaka, R. (eds.) Proceedings of the 12th International Conference on Grammatical Inference, ICGI 2014, Kyoto, Japan, 17\u201319 September 2014. JMLR Workshop and Conference Proceedings, vol.\u00a034, pp. 79\u201393. JMLR.org (2014). http:\/\/proceedings.mlr.press\/v34\/isberner14a.html"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Koenders, R., Moerman, J.: Output-decomposed learning of mealy machines. CoRR arxiv:2405.08647 (2024). https:\/\/doi.org\/10.48550\/ARXIV.2405.08647","DOI":"10.48550\/ARXIV.2405.08647"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Labbaf, F., Groote, J.F., Hojjat, H., Mousavi, M.R.: Compositional learning for interleaving parallel automata. In: Kupferman, O., Sobocinski, P. (eds.) Foundations of Software Science and Computation Structures - 26th International Conference, FoSSaCS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, 22\u201327 April 2023, Proceedings. Lecture Notes in Computer Science, vol. 13992, pp. 413\u2013435. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30829-1_20","DOI":"10.1007\/978-3-031-30829-1_20"},{"issue":"5\u20136","key":"1_CR17","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/S10009-012-0236-Z","volume":"15","author":"Y Lustig","year":"2013","unstructured":"Lustig, Y., Vardi, M.Y.: Synthesis from component libraries. Int. J. Softw. Tools Technol. Transf. 15(5\u20136), 603\u2013618 (2013). https:\/\/doi.org\/10.1007\/S10009-012-0236-Z","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"issue":"7","key":"1_CR18","doi-asserted-by":"publisher","first-page":"3692","DOI":"10.1109\/TSE.2023.3267848","volume":"49","author":"I Malavolta","year":"2023","unstructured":"Malavolta, I., et al.: Javascript dead code identification, elimination, and empirical assessment. IEEE Trans. Softw. Eng. 49(7), 3692\u20133714 (2023). https:\/\/doi.org\/10.1109\/TSE.2023.3267848","journal-title":"IEEE Trans. Softw. Eng."},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23021-4","volume-title":"Algebraic Informatics","year":"2015","unstructured":"Maletti, A. (ed.): CAI 2015. LNCS, vol. 9270. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23021-4"},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Meijer, J., van de Pol, J.: Sound black-box checking in the learnlib. Innov. Syst. Softw. Eng. 15(3-4), 267\u2013287 (2019). https:\/\/doi.org\/10.1007\/s11334-019-00342-6","DOI":"10.1007\/s11334-019-00342-6"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Neele, T., Sammartino, M.: Compositional automata learning of synchronous systems. In: Lambers, L., Uchitel, S. (eds.) Fundamental Approaches to Software Engineering - 26th International Conference, FASE 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, 22\u201327 April 2023, Proceedings. Lecture Notes in Computer Science, vol. 13991, pp. 47\u201366. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30826-0_3","DOI":"10.1007\/978-3-031-30826-0_3"},{"key":"1_CR22","unstructured":"Niese, O.: An integrated approach to testing complex systems. Ph.D. thesis, Technical University of Dortmund, Germany (2003). http:\/\/eldorado.uni-dortmund.de:8080\/0x81d98002_0x0007b62b"},{"key":"1_CR23","unstructured":"OASIS: MQTT Version 5 (2019). https:\/\/docs.oasis-open.org\/mqtt\/mqtt\/v5.0\/mqtt-v5.0.pdf"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Peled, D.A., Vardi, M.Y., Yannakakis, M.: Black box checking. In: Wu, J., Chanson, S.T., Gao, Q. (eds.) Formal Methods for Protocol Engineering and Distributed Systems, FORTE XII \/ PSTV XIX\u201999, IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XII) and Protocol Specification, Testing and Verification (PSTV XIX), Beijing, China, 5\u20138 October 1999. IFIP Conference Proceedings, vol.\u00a0156, pp. 225\u2013240. Kluwer (1999)","DOI":"10.1007\/978-0-387-35578-8_13"},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, 22\u201324 October 1990, vol. II, pp. 746\u2013757. IEEE Computer Society (1990). https:\/\/doi.org\/10.1109\/FSCS.1990.89597","DOI":"10.1109\/FSCS.1990.89597"},{"issue":"2","key":"1_CR26","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). https:\/\/doi.org\/10.1006\/INCO.1993.1021","journal-title":"Inf. Comput."},{"key":"1_CR27","doi-asserted-by":"publisher","unstructured":"Shijubo, J., Waga, M., Suenaga, K.: Probabilistic black-box checking via active MDP learning. ACM Trans. Embed. Comput. Syst. 22(5s), 148:1\u2013148:26 (2023). https:\/\/doi.org\/10.1145\/3609127","DOI":"10.1145\/3609127"},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"Tappler, M., Aichernig, B.K., Bloem, R.: Model-based testing iot communication via active automata learning. In: 2017 IEEE International Conference on Software Testing, Verification and Validation, ICST 2017, Tokyo, Japan, 13\u201317 March 2017, pp. 276\u2013287. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/ICST.2017.32","DOI":"10.1109\/ICST.2017.32"},{"key":"1_CR29","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"},{"issue":"1","key":"1_CR30","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1109\/TASE.2019.2929563","volume":"17","author":"H Zhang","year":"2020","unstructured":"Zhang, H., Feng, L., Li, Z.: Control of black-box embedded systems by integrating automaton learning and supervisory control theory of discrete-event systems. IEEE Trans. Autom. Sci. Eng. 17(1), 361\u2013374 (2020). https:\/\/doi.org\/10.1109\/TASE.2019.2929563","journal-title":"IEEE Trans. Autom. Sci. Eng."}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T22:33:40Z","timestamp":1761431620000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-08707-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,26]]},"ISBN":["9783032087065","9783032087072"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-08707-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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"}}]}}