{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T07:47:58Z","timestamp":1771573678841,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030171261","type":"print"},{"value":"9783030171278","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,4,5]],"date-time":"2019-04-05T00:00:00Z","timestamp":1554422400000},"content-version":"vor","delay-in-days":94,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Automata learning is a popular technique for inferring minimal automata through membership and equivalence queries. In this paper, we generalise learning to the theory of coalgebras. The approach relies on the use of logical formulas as tests, based on a dual adjunction between states and logical theories. This allows us to learn, e.g., labelled transition systems, using Hennessy-Milner logic. Our main contribution is an abstract learning algorithm, together with a proof of correctness and termination.<\/jats:p>","DOI":"10.1007\/978-3-030-17127-8_4","type":"book-chapter","created":{"date-parts":[[2019,4,5]],"date-time":"2019-04-05T11:11:46Z","timestamp":1554462706000},"page":"62-79","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Coalgebra Learning via Duality"],"prefix":"10.1007","author":[{"given":"Simone","family":"Barlocco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clemens","family":"Kupke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jurriaan","family":"Rot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,5]]},"reference":[{"issue":"4","key":"4_CR1","first-page":"447","volume":"41","author":"J Ad\u00e1mek","year":"2007","unstructured":"Ad\u00e1mek, J., L\u00fccke, D., Milius, S.: Recursive coalgebras of finitary functors. ITA 41(4), 447\u2013462 (2007)","journal-title":"ITA"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Ad\u00e1mek, J., Milius, S., Moss, L.S., Sousa, L.: Well-pointed coalgebras. Logical Methods Comput. Sci. 9(3) (2013)","DOI":"10.2168\/LMCS-9(3:2)2013"},{"key":"4_CR3","series-title":"Cambridge Tracts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511600579","volume-title":"Locally Presentable and Accessible Categories","author":"J Ad\u00e1mek","year":"1994","unstructured":"Ad\u00e1mek, J., Rosick\u00fd, J.: Locally Presentable and Accessible Categories. Cambridge Tracts in Mathematics. Cambridge University Press, Cambridge (1994)"},{"issue":"2","key":"4_CR4","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":"4_CR5","unstructured":"Angluin, D., Eisenstat, S., Fisman, D.: Learning regular languages via alternating automata. In: Yang, Q., Wooldridge, M. (eds.) IJCAI 2015, pp. 3308\u20133314. AAAI Press (2015)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-319-72056-2_5","volume-title":"Logical Foundations of Computer Science","author":"S Barlocco","year":"2018","unstructured":"Barlocco, S., Kupke, C.: Angluin learning via logic. In: Artemov, S., Nerode, A. (eds.) LFCS 2018. LNCS, vol. 10703, pp. 72\u201390. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-72056-2_5"},{"key":"4_CR7","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107050884","volume-title":"Modal Logic","author":"P Blackburn","year":"2001","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science, vol. 53. Cambridge University Press, Cambridge (2001)"},{"key":"4_CR8","unstructured":"Blok, A.: Interaction, observation and denotation. Master\u2019s thesis, ILLC Amsterdam (2012)"},{"key":"4_CR9","unstructured":"Bollig, B., Habermehl, P., Kern, C., Leucker, M.: Angluin-style learning of NFA. In: Boutilier, C. (ed.) Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI 2009, pp. 1004\u20131009 (2009)"},{"key":"4_CR10","series-title":"Encyclopedia of Mathematics and its Applications","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511525872","volume-title":"Handbook of Categorical Algebra","author":"F Borceux","year":"1994","unstructured":"Borceux, F.: Handbook of Categorical Algebra. Encyclopedia of Mathematics and its Applications, vol. 1. Cambridge University Press, Cambridge (1994)"},{"key":"4_CR11","unstructured":"van Heerdt, G.: An abstract automata learning framework. Master\u2019s thesis, Radboud Universiteit Nijmegen (2016)"},{"key":"4_CR12","unstructured":"van Heerdt, G., Sammartino, M., Silva, A.: CALF: categorical automata learning framework. In: Goranko, V., Dam, M. (eds.) 26th EACSL Annual Conference on Computer Science Logic, CSL 2017. LIPIcs, vol. 2, pp. 29:1\u201329:24. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"key":"4_CR13","unstructured":"van Heerdt, G., Sammartino, M., Silva, A.: Learning automata with side-effects. CoRR, abs\/1704.08055 (2017)"},{"key":"4_CR14","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316823187","volume-title":"Introduction to Coalgebra: Towards Mathematics of States and Observation","author":"B Jacobs","year":"2016","unstructured":"Jacobs, B.: Introduction to Coalgebra: Towards Mathematics of States and Observation. Cambridge Tracts in Theoretical Computer Science, vol. 59. Cambridge University Press, Cambridge (2016)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-319-06880-0_20","volume-title":"Horizons of the Mind. A Tribute to Prakash Panangaden","author":"B Jacobs","year":"2014","unstructured":"Jacobs, B., Silva, A.: Automata learning: a categorical perspective. In: van Breugel, F., Kashefi, E., Palamidessi, C., Rutten, J. (eds.) Panangaden Festschrift. LNCS, vol. 8464, pp. 384\u2013406. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06880-0_20"},{"issue":"5","key":"4_CR16","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1016\/j.jcss.2014.12.005","volume":"81","author":"B Jacobs","year":"2015","unstructured":"Jacobs, B., Silva, A., Sokolova, A.: Trace semantics via determinization. J. Comput. Syst. Sci. 81(5), 859\u2013879 (2015)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"4_CR17","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1093\/logcom\/exn093","volume":"20","author":"B Jacobs","year":"2009","unstructured":"Jacobs, B., Sokolova, A.: Exemplaric expressivity of modal logics. J. Logic Comput. 20(5), 1041\u20131068 (2009)","journal-title":"J. Logic Comput."},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.entcs.2007.02.034","volume":"173","author":"B Klin","year":"2007","unstructured":"Klin, B.: Coalgebraic modal logic beyond sets. Electr. Notes Theor. Comput. Sci. 173, 177\u2013201 (2007)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Klin, B., Rot, J.: Coalgebraic trace semantics via forgetful logics. Logical Methods Comput. Sci. 12(4) (2016)","DOI":"10.2168\/LMCS-12(4:10)2016"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.entcs.2004.02.037","volume":"106","author":"C Kupke","year":"2004","unstructured":"Kupke, C., Kurz, A., Pattinson, D.: Algebraic semantics for coalgebraic logics. Electr. Notes Theor. Comput. Sci. 106, 219\u2013241 (2004)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"38","key":"4_CR21","doi-asserted-by":"publisher","first-page":"5070","DOI":"10.1016\/j.tcs.2011.04.023","volume":"412","author":"C Kupke","year":"2011","unstructured":"Kupke, C., Pattinson, D.: Coalgebraic semantics of modal logics: an overview. Theor. Comput. Sci. 412(38), 5070\u20135094 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"4_CR22","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."},{"issue":"1","key":"4_CR23","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-4049(74)90032-2","volume":"4","author":"G Osius","year":"1974","unstructured":"Osius, G.: Categorical set theory: a characterization of the category of sets. J. Pure Appl. Algebra 4(1), 79\u2013119 (1974)","journal-title":"J. Pure Appl. Algebra"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/11784180_24","volume-title":"Algebraic Methodology and Software Technology","author":"D Pavlovic","year":"2006","unstructured":"Pavlovic, D., Mislove, M., Worrell, J.B.: Testing semantics: connecting processes and process logics. In: Johnson, M., Vene, V. (eds.) AMAST 2006. LNCS, vol. 4019, pp. 308\u2013322. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11784180_24"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/BFb0055624","volume-title":"CONCUR\u201998 Concurrency Theory","author":"JJMM Rutten","year":"1998","unstructured":"Rutten, J.J.M.M.: Automata and coinduction (an exercise in coalgebra). In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 194\u2013218. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055624"},{"issue":"1","key":"4_CR26","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"JJMM Rutten","year":"2000","unstructured":"Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theor. Comput. Sci. 249(1), 3\u201380 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"2\u20133","key":"4_CR27","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.tcs.2007.09.023","volume":"390","author":"L Schr\u00f6der","year":"2008","unstructured":"Schr\u00f6der, L.: Expressivity of coalgebraic modal logic: the limits and beyond. Theor. Comput. Sci. 390(2\u20133), 230\u2013247 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR28","volume-title":"Practical Foundations of Mathematics","author":"P Taylor","year":"1999","unstructured":"Taylor, P.: Practical Foundations of Mathematics. Cambridge University Press, Cambridge (1999)"},{"issue":"1","key":"4_CR29","first-page":"143","volume":"12","author":"V Trnkov\u00e1","year":"1971","unstructured":"Trnkov\u00e1, V.: On descriptive classification of set-functors. I. Comment. Math. Univ. Carolinae 12(1), 143\u2013174 (1971)","journal-title":"Comment. Math. Univ. Carolinae"},{"issue":"2","key":"4_CR30","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"}],"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-030-17127-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T16:14:40Z","timestamp":1757088880000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17127-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030171261","9783030171278"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17127-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"5 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2019\/fossacs","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}