{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T16:10:55Z","timestamp":1746115855227,"version":"3.40.4"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031908965"},{"type":"electronic","value":"9783031908972"}],"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:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"vor","delay-in-days":120,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Conformance testing of automata is about checking the equivalence of a known specification and a black-box implementation. An important notion in conformance testing is that of a complete test suite, which guarantees that if an implementation satisfying certain conditions passes all tests, then it is equivalent to the specification.<\/jats:p>\n          <jats:p>We introduce a framework for proving completeness of test suites at the general level of automata in monoidal closed categories. Moreover, we provide a generalization of a classical conformance testing technique, the W-method. We demonstrate the applicability of our results by recovering the W-method for deterministic finite automata, Moore machines, and Mealy machines, and by deriving new instances of complete test suites for weighted automata and deterministic nominal automata.<\/jats:p>","DOI":"10.1007\/978-3-031-90897-2_10","type":"book-chapter","created":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T08:18:04Z","timestamp":1746001084000},"page":"198-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Complete Test Suites for Automata in Monoidal Closed Categories"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0570-3031","authenticated-orcid":false,"given":"B\u00e1lint","family":"Kocsis","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1404-6232","authenticated-orcid":false,"given":"Jurriaan","family":"Rot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,1]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Aarts, F., Heidarian, F., Kuppens, H., Olsen, P., Vaandrager, F.W.: Automata learning through counterexample guided abstraction refinement. In: FM. Lecture Notes in Computer Science, vol.\u00a07436, pp. 10\u201327. Springer (2012)","DOI":"10.1007\/978-3-642-32759-9_4"},{"key":"10_CR2","unstructured":"Ad\u00e1mek, J., Rosick\u00fd, J.: Locally presentable and accessible categories, London Mathematical Society Lecture Note Series, vol.\u00a0189. Cambridge University Press (1994)"},{"key":"10_CR3","unstructured":"Ad\u00e1mek, J., Trnkov\u00e1, V.: Automata and algebras in categories, Mathematics and Its Applications, vol.\u00a037. Springer Netherlands (1990)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87\u2013106 (1987)","DOI":"10.1016\/0890-5401(87)90052-6"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Angluin, D., Antonopoulos, T., Fisman, D.: Query learning of derived $$\\omega $$-tree languages in polynomial time. Log. Methods Comput. Sci. 15(3) (2019)","DOI":"10.23638\/LMCS-15(3:21)2019"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Arbib, M.A., Manes, E.G.: Adjoint machines, state-behavior machines, and duality. Journal of Pure and Applied Algebra 6(3), 313\u2013344 (1975)","DOI":"10.1016\/0022-4049(75)90028-6"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Aslam, K., Cleophas, L., Schiffelers, R.R.H., van\u00a0den Brand, M.: Interface protocol inference to aid understanding legacy software components. Softw. Syst. Model. 19(6), 1519\u20131540 (2020), https:\/\/doi.org\/10.1007\/s10270-020-00809-2","DOI":"10.1007\/s10270-020-00809-2"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Balle, B., Mohri, M.: Learning weighted automata. In: CAI. Lecture Notes in Computer Science, vol.\u00a09270, pp. 1\u201321. Springer (2015)","DOI":"10.1007\/978-3-319-23021-4_1"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Barlocco, S., Kupke, C., Rot, J.: Coalgebra learning via duality. In: FoSSaCS. Lecture Notes in Computer Science, vol. 11425, pp. 62\u201379. Springer (2019)","DOI":"10.1007\/978-3-030-17127-8_4"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Bergadano, F., Varricchio, S.: Learning behaviors of automata from multiplicity and equivalence queries. SIAM J. Comput. 25(6), 1268\u20131280 (1996). https:\/\/doi.org\/10.1137\/S009753979326091X","DOI":"10.1137\/S009753979326091X"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., Klin, B., Lasota, S.: Automata theory in nominal sets. Log. Methods Comput. Sci. 10(3) (2014)","DOI":"10.2168\/LMCS-10(3:4)2014"},{"key":"10_CR12","unstructured":"Bollig, B., Habermehl, P., Kern, C., Leucker, M.: Angluin-style learning of NFA. In: IJCAI. pp. 1004\u20131009 (2009)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Bollig, B., Habermehl, P., Leucker, M., Monmege, B.: A fresh approach to learning register automata. In: Developments in Language Theory. Lecture Notes in Computer Science, vol.\u00a07907, pp. 118\u2013130. Springer (2013)","DOI":"10.1007\/978-3-642-38771-5_12"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"van\u00a0den Bos, P., Janssen, R., Moerman, J.: n-Complete test suites for IOCO. Softw. Qual. J. 27(2), 563\u2013588 (2019)","DOI":"10.1007\/s11219-018-9422-x"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Broy, M., Jonsson, B., Katoen, J.P., Leucker, M., Pretschner, A. (eds.): Model-based testing of reactive systems, Lecture Notes in Computer Science, vol.\u00a03472. Springer (2005)","DOI":"10.1007\/b137241"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. J. ACM 11(4), 481\u2013494 (1964)","DOI":"10.1145\/321239.321249"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Buna-Marginean, A., Cheval, V., Shirmohammadi, M., Worrell, J.: On learning polynomial recursive programs. Proc. ACM Program. Lang. 8(POPL), 1001\u20131027 (2024)","DOI":"10.1145\/3632876"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Cassel, S., Howar, F., Jonsson, B., Steffen, B.: Active learning for extended finite state machines. Formal Aspects Comput. 28(2), 233\u2013263 (2016)","DOI":"10.1007\/s00165-016-0355-5"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Chow, T.S.: Testing software design modeled by finite-state machines. IEEE Trans. Software Eng. 4(3), 178\u2013187 (1978)","DOI":"10.1109\/TSE.1978.231496"},{"key":"10_CR20","unstructured":"Colcombet, T., Petrisan, D., Stabile, R.: Learning automata and transducers: A categorical approach. In: CSL. LIPIcs, vol.\u00a0183, pp. 15:1\u201315:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Dorofeeva, R., El-Fakih, K., Maag, S., Cavalli, A.R., Yevtushenko, N.: FSM-based conformance testing methods: A survey annotated with experimental evaluation. Inf. Softw. Technol. 52(12), 1286\u20131297 (2010)","DOI":"10.1016\/j.infsof.2010.07.001"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Droste, M., Kuske, D.: Weighted automata. In: Handbook of Automata Theory (I.), pp. 113\u2013150. European Mathematical Society Publishing House, Z\u00fcrich, Switzerland (2021)","DOI":"10.4171\/automata-1\/4"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Fujiwara, S., von Bochmann, G., Khendek, F., Amalou, M., Ghedamsi, A.: Test selection based on finite state models. IEEE Trans. Software Eng. 17(6), 591\u2013603 (1991)","DOI":"10.1109\/32.87284"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Goguen, J.A.: Discrete-time machines in closed monoidal categories I. J. Comput. Syst. Sci. 10(1), 1\u201343 (1975)","DOI":"10.1016\/S0022-0000(75)80012-2"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"van Heerdt, G., Kupke, C., Rot, J., Silva, A.: Learning weighted automata over principal ideal domains. In: FoSSaCS. Lecture Notes in Computer Science, vol. 12077, pp. 602\u2013621. Springer (2020)","DOI":"10.1007\/978-3-030-45231-5_31"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"van Heerdt, G., Sammartino, M., Silva, A.: Learning automata with side-effects. In: CMCS. Lecture Notes in Computer Science, vol. 12094, pp. 68\u201389. Springer (2020)","DOI":"10.1007\/978-3-030-57201-3_5"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Howar, F., Steffen, B.: Active automata learning in practice: An annotated bibliography of the years 2011 to 2016. In: Machine Learning for Dynamic Software Analysis. Lecture Notes in Computer Science, vol. 11026, pp. 123\u2013148. Springer (2018)","DOI":"10.1007\/978-3-319-96562-8_5"},{"key":"10_CR28","unstructured":"Isberner, M.: Foundations of active automata learning: an algorithmic perspective. Ph.D. thesis, Technical University Dortmund, Germany (2015)"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Isberner, M., Howar, F., Steffen, B.: The open-source LearnLib: A framework for active automata learning. In: CAV (1). Lecture Notes in Computer Science, vol.\u00a09206, pp. 487\u2013495. Springer (2015)","DOI":"10.1007\/978-3-319-21690-4_32"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Jacobs, B., Rutten, J.J.M.M.: A tutorial on (co)algebras and (co)induction. Bulletin-European Association for Theoretical Computer Science 62, 222\u2013259 (1997)","DOI":"10.1016\/S1571-0661(05)80564-X"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Kanso, B., Aiguier, M., Boulanger, F., Touil, A.: Testing of abstract components. In: ICTAC. Lecture Notes in Computer Science, vol.\u00a06255, pp. 184\u2013198. Springer (2010)","DOI":"10.1007\/978-3-642-14808-8_13"},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"Kl\u00edma, O., Pol\u00e1k, L.: On varieties of ordered automata. In: LATA. Lecture Notes in Computer Science, vol. 11417, pp. 108\u2013120. Springer (2019)","DOI":"10.1007\/978-3-030-13435-8_8"},{"key":"10_CR33","unstructured":"Kocsis, B., Rot, J.: Complete test suites for automata in monoidal closed categories. CoRR abs\/2411.13412 (2024), https:\/\/arxiv.org\/abs\/2411.13412, extended version"},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"Kruger, L., Junges, S., Rot, J.: Small test suites for active automata learning. In: TACAS (2). Lecture Notes in Computer Science, vol. 14571, pp. 109\u2013129. Springer (2024)","DOI":"10.1007\/978-3-031-57249-4_6"},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines \u2013 a survey. Proc. IEEE 84(8), 1090\u20131123 (1996)","DOI":"10.1109\/5.533956"},{"key":"10_CR36","unstructured":"Maarse, T.: Active Mealy machine learning using action refinements. Master\u2019s thesis, Radboud University Nijmegen, The Netherlands (2020)"},{"key":"10_CR37","unstructured":"Mac\u00a0Lane, S.: Categories for the working mathematician, Graduate Texts in Mathematics, vol.\u00a05. Springer New York (2013)"},{"key":"10_CR38","doi-asserted-by":"crossref","unstructured":"Maler, O., Pnueli, A.: On the learnability of infinitary regular sets. Inf. Comput. 118(2), 316\u2013326 (1995), https:\/\/doi.org\/10.1006\/inco.1995.1070","DOI":"10.1006\/inco.1995.1070"},{"key":"10_CR39","doi-asserted-by":"crossref","unstructured":"Margaria, T., Niese, O., Raffelt, H., Steffen, B.: Efficient test-based model generation for legacy reactive systems. In: HLDVT. pp. 95\u2013100. IEEE Computer Society (2004)","DOI":"10.1109\/HLDVT.2004.1431246"},{"key":"10_CR40","unstructured":"Moerman, J.S.: Nominal techniques and black box testing for automata learning. Ph.D. thesis, Radboud University Nijmegen, The Netherlands (2019)"},{"key":"10_CR41","doi-asserted-by":"crossref","unstructured":"Moerman, J.S., Sammartino, M., Silva, A., Klin, B., Szynwelski, M.: Learning nominal automata. In: POPL. pp. 613\u2013625. ACM (2017)","DOI":"10.1145\/3009837.3009879"},{"key":"10_CR42","doi-asserted-by":"crossref","unstructured":"Moore, E.F.: Gedanken-experiments on sequential machines. In: Automata Studies, pp. 129\u2013153. Princeton University Press (1956)","DOI":"10.1515\/9781400882618-006"},{"key":"10_CR43","doi-asserted-by":"crossref","unstructured":"Muskardin, E., Aichernig, B.K., Pill, I., Pferscher, A., Tappler, M.: AALpy: An active automata learning library. In: ATVA. Lecture Notes in Computer Science, vol. 12971, pp. 67\u201373. Springer (2021)","DOI":"10.1007\/978-3-030-88885-5_5"},{"key":"10_CR44","doi-asserted-by":"crossref","unstructured":"Petrenko, A., Yevtushenko, N.: Adaptive testing of nondeterministic systems with FSM. In: HASE. pp. 224\u2013228. IEEE Computer Society (2014)","DOI":"10.1109\/HASE.2014.39"},{"key":"10_CR45","doi-asserted-by":"crossref","unstructured":"Pitts, A.M.: Nominal sets: Names and symmetry in computer science, Cambridge Tracts in Theoretical Computer Science, vol.\u00a057. Cambridge University Press (2013)","DOI":"10.1017\/CBO9781139084673"},{"key":"10_CR46","doi-asserted-by":"crossref","unstructured":"Rabin, M.O., Scott, D.S.: Finite automata and their decision problems. IBM J. Res. Dev. 3(2), 114\u2013125 (1959)","DOI":"10.1147\/rd.32.0114"},{"key":"10_CR47","doi-asserted-by":"crossref","unstructured":"Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theor. Comput. Sci. 249(1), 3\u201380 (2000)","DOI":"10.1016\/S0304-3975(00)00056-6"},{"key":"10_CR48","doi-asserted-by":"crossref","unstructured":"Tappler, M., Aichernig, B.K., Bacci, G., Eichlseder, M., Larsen, K.G.: L*-based learning of Markov decision processes (extended version). Formal Aspects Comput. 33(4), 575\u2013615 (2021)","DOI":"10.1007\/s00165-021-00536-5"},{"key":"10_CR49","doi-asserted-by":"crossref","unstructured":"Urbat, H., Schr\u00f6der, L.: Automata learning: An algebraic approach. In: LICS. pp. 900\u2013914. ACM (2020)","DOI":"10.1145\/3373718.3394775"},{"key":"10_CR50","doi-asserted-by":"crossref","unstructured":"Vaandrager, F.W.: Model learning. Commun. ACM 60(2), 86\u201395 (2017)","DOI":"10.1145\/2967606"},{"key":"10_CR51","unstructured":"Vaandrager, F.W., Fiter\u01ceu-Bro\u015ftean, P., Melse, I.: Completeness of FSM test suites reconsidered (2024), https:\/\/arxiv.org\/abs\/2410.19405"},{"key":"10_CR52","doi-asserted-by":"crossref","unstructured":"Vasilevskii, M.P.: Failure diagnosis of automata. Cybernetics 9(4), 653\u2013665 (1973)","DOI":"10.1007\/BF01068590"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-90897-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T08:18:37Z","timestamp":1746001117000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-90897-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031908965","9783031908972"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-90897-2_10","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 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"FoSSaCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hamilton, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"3 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2025\/conferences\/fossacs\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}