{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T11:01:34Z","timestamp":1753354894688},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319720555"},{"type":"electronic","value":"9783319720562"}],"license":[{"start":{"date-parts":[[2017,11,28]],"date-time":"2017-11-28T00:00:00Z","timestamp":1511827200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-72056-2_5","type":"book-chapter","created":{"date-parts":[[2017,11,27]],"date-time":"2017-11-27T04:33:31Z","timestamp":1511757211000},"page":"72-90","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Angluin Learning via Logic"],"prefix":"10.1007","author":[{"given":"Simone","family":"Barlocco","sequence":"first","affiliation":[]},{"given":"Clemens","family":"Kupke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,28]]},"reference":[{"key":"5_CR1","series-title":"Cambridge Tracts in TCS","doi-asserted-by":"crossref","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 TCS. Cambridge University Press, New York (2016)"},{"key":"5_CR2","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.) Horizons of the Mind. A Tribute to Prakash Panangaden. LNCS, vol. 8464, pp. 384\u2013406. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06880-0_20"},{"key":"5_CR3","unstructured":"van Heerdt, G.: An abstract automata learning framework. Master\u2019s thesis, Radboud Universiteit Nijmegen (2016)"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Moerman, J., Sammartino, M., Silva, A., Klin, B., Szynwelski, M.: Learning nominal automata. In: POPL 2017 (2017)","DOI":"10.1145\/3009837.3009879"},{"key":"5_CR5","unstructured":"van Heerdt, G., Sammartino, M., Silva, A.: Learning automata with side-effects. CoRR abs\/1704.08055 (2017)"},{"issue":"2","key":"5_CR6","doi-asserted-by":"crossref","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 counter examples. Inf. Comput. 75(2), 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"key":"5_CR7","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":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36387-4","volume-title":"Automata Logics, and Infinite Games","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36387-4"},{"key":"5_CR9","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4721-8","volume-title":"Categories for the Working Mathematician","author":"S Mac Lane","year":"1971","unstructured":"Mac Lane, S.: Categories for the Working Mathematician. Graduate Texts in Mathematics, vol. 5. Springer, New York (1971). https:\/\/doi.org\/10.1007\/978-1-4757-4721-8"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Jacobs, B., Rutten., J.: An introduction to (co)algebras and (co)induction. In: Advanced Topics in Bisimulation and Coinduction. Cambridge Tracts in Theoretical Computer Science, vol. 5, pp. 38\u201399. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511792588.003"},{"key":"5_CR11","volume-title":"Automata and Algebras in Categories","author":"J Ad\u00e1mek","year":"1990","unstructured":"Ad\u00e1mek, J., Trnkov\u00e1, V.: Automata and Algebras in Categories. Kluwer Academic Publishers, Dordrecht (1990)"},{"issue":"1","key":"5_CR12","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1093\/comjnl\/bxp004","volume":"54","author":"C Cirstea","year":"2009","unstructured":"Cirstea, C., Kurz, A., Pattinson, D., Schr\u00f6der, L., Venema, Y.: Modal logics are coalgebraic. Comput. J. 54(1), 31\u201341 (2009)","journal-title":"Comput. J."},{"issue":"38","key":"5_CR13","doi-asserted-by":"crossref","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. Theoret. Comput. Sci. 412(38), 5070\u20135094 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"5_CR14","doi-asserted-by":"crossref","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. Theoret. Comput. Sci. 390(2), 230\u2013247 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR15","first-page":"97","volume":"20","author":"HH Hansen","year":"2010","unstructured":"Hansen, H.H., Rutten, J.J.M.M.: Symbolic synthesis of mealy machines from arithmetic bitstream functions. Sci. Ann. Comp. Sci. 20, 97\u2013130 (2010)","journal-title":"Sci. Ann. Comp. Sci."},{"issue":"2","key":"5_CR16","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1006\/inco.2001.2962","volume":"179","author":"J Desharnais","year":"2002","unstructured":"Desharnais, J., Edalat, A., Panangaden, P.: Bisimulation for labelled markov processes. Inf. Comput. 179(2), 163\u2013193 (2002)","journal-title":"Inf. Comput."},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-03741-2_8","volume-title":"Algebra and Coalgebra in Computer Science","author":"C Kupke","year":"2009","unstructured":"Kupke, C., Leal, R.A.: Characterising behavioural equivalence: three sides of one coin. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol. 5728, pp. 97\u2013112. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03741-2_8"},{"key":"5_CR18","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"crossref","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, New York (2001)"},{"issue":"2","key":"5_CR19","doi-asserted-by":"crossref","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":"5_CR20","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.tcs.2012.10.009","volume":"473","author":"B Balle","year":"2013","unstructured":"Balle, B., Castro, J., Gavald, R.: Learning probabilistic automata: a study in state distinguishability. TCS 473, 46\u201360 (2013)","journal-title":"TCS"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Mao, H., Chen, Y., Jaeger, M., Nielsen, T.D., Larsen, K.G., Nielsen, B.: Learning probabilistic automata for model checking. In: 2011 Eighth International Conference on Quantitative Evaluation of Systems, pp. 111\u2013120 (2011)","DOI":"10.1109\/QEST.2011.21"},{"issue":"2","key":"5_CR22","first-page":"151","volume":"8","author":"WG Tzeng","year":"1992","unstructured":"Tzeng, W.G.: Learning probabilistic automata and markov chains via queries. Mach. Learn. 8(2), 151\u2013166 (1992)","journal-title":"Mach. Learn."},{"issue":"38","key":"5_CR23","doi-asserted-by":"crossref","first-page":"5095","DOI":"10.1016\/j.tcs.2011.05.008","volume":"412","author":"A Sokolova","year":"2011","unstructured":"Sokolova, A.: Probabilistic systems coalgebraically: a survey. TCS 412(38), 5095\u20135110 (2011)","journal-title":"TCS"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-17796-5_5","volume-title":"Algebraic Methodology and Software Technology","author":"R Gl\u00fcck","year":"2011","unstructured":"Gl\u00fcck, R., M\u00f6ller, B., Sintzoff, M.: Model refinement using bisimulation quotients. In: Johnson, M., Pavlovic, D. (eds.) AMAST 2010. LNCS, vol. 6486, pp. 76\u201391. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-17796-5_5"},{"issue":"3","key":"5_CR25","doi-asserted-by":"crossref","first-page":"193","DOI":"10.3166\/jancl.20.193-217","volume":"20","author":"S Ghilardi","year":"2010","unstructured":"Ghilardi, S.: Continuity, freeness, and filtrations. J. Appl. Non Class. Logics 20(3), 193\u2013217 (2010)","journal-title":"J. Appl. Non Class. Logics"},{"issue":"1","key":"5_CR26","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1017\/jsl.2015.54","volume":"81","author":"G Bezhanishvili","year":"2016","unstructured":"Bezhanishvili, G., Bezhanishvili, N., Iemhoff, R.: Stable canonical rules. J. Symbol. Logic 81(1), 284\u2013315 (2016)","journal-title":"J. Symbol. Logic"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72056-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,8]],"date-time":"2022-08-08T16:03:02Z","timestamp":1659974582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72056-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,28]]},"ISBN":["9783319720555","9783319720562"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72056-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017,11,28]]}}}