{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:06:45Z","timestamp":1742998005252,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031664373"},{"type":"electronic","value":"9783031664380"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-66438-0_2","type":"book-chapter","created":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T07:03:08Z","timestamp":1721890988000},"page":"23-43","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Categorical Approach to\u00a0Coalgebraic Fixpoint Logic"],"prefix":"10.1007","author":[{"given":"Ezra","family":"Schoen","sequence":"first","affiliation":[]},{"given":"Clemens","family":"Kupke","sequence":"additional","affiliation":[]},{"given":"Jurriaan","family":"Rot","sequence":"additional","affiliation":[]},{"given":"Ruben","family":"Turkenburg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,26]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-40206-7_6","volume-title":"Algebra and Coalgebra in Computer Science","author":"A Balan","year":"2013","unstructured":"Balan, A., Kurz, A., Velebil, J.: Positive fragments of coalgebraic logics. In: Heckel, R., Milius, S. (eds.) CALCO 2013. LNCS, vol. 8089, pp. 51\u201365. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40206-7_6"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-030-17127-8_4","volume-title":"Foundations of Software Science and Computation Structures","author":"S Barlocco","year":"2019","unstructured":"Barlocco, S., Kupke, C., Rot, J.: Coalgebra learning via duality. In: Boja\u0144czyk, M., Simpson, A. (eds.) FoSSaCS 2019. LNCS, vol. 11425, pp. 62\u201379. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17127-8_4"},{"issue":"4","key":"2_CR3","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"JA Brzozowski","year":"1964","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. J. ACM 11(4), 481\u2013494 (1964)","journal-title":"J. ACM"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"C\u00eerstea, C., Kupke, C., Pattinson, D.: EXPTIME tableaux for the coalgebraic mu-calculus. Log. Methods Comput. Sci. 7(3) (2011)","DOI":"10.2168\/LMCS-7(3:3)2011"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"C\u00eerstea, C., Kurz, A., Pattinson, D., Schr\u00f6der, L., Venema, Y.: Modal logics are coalgebraic. In: BCS International Academic Conference, pp. 128\u2013140. British Computer Society (2008)","DOI":"10.14236\/ewic\/VOCS2008.12"},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.2140\/pjm.1979.82.43","volume":"82","author":"P Cousot","year":"1979","unstructured":"Cousot, P., Cousot, R.: Constructive versions of Tarski\u2019s fixed point theorems. Pac. J. Math. 82(1), 43\u201357 (1979)","journal-title":"Pac. J. Math."},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-319-40370-0_11","volume-title":"Coalgebraic Methods in Computer Science","author":"F Dahlqvist","year":"2016","unstructured":"Dahlqvist, F.: Coalgebraic completeness-via-canonicity. In: Hasuo, I. (ed.) CMCS 2016. LNCS, vol. 9608, pp. 174\u2013194. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40370-0_11"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Facchini, A., Venema, Y., Zanasi, F.: A characterization theorem for the alternation-free fragment of the modal $$\\rm \\mu $$-calculus. In: LICS, pp. 478\u2013487. IEEE Computer Society (2013)","DOI":"10.1109\/LICS.2013.54"},{"key":"2_CR9","unstructured":"Forster, J., Schr\u00f6der, L.: Non-iterative modal logics are coalgebraic. In: AiML, pp. 229\u2013248. College Publications (2020)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Gu, T., Silva, A., Zanasi, F.: Hennessy-Milner results for probabilistic PDL. In: MFPS. Electronic Notes in Theoretical Computer Science, vol. 352, pp. 283\u2013304. Elsevier (2020)","DOI":"10.1016\/j.entcs.2020.09.014"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Hansen, H.H., Kupke, C.: Weak completeness of coalgebraic dynamic logics. In: FICS. EPTCS, vol. 191, pp. 90\u2013104 (2015)","DOI":"10.4204\/EPTCS.191.9"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-031-50524-9_8","volume-title":"Verification, Model Checking, and Abstract Interpretation - VMCAI 2024","author":"D Hausmann","year":"2024","unstructured":"Hausmann, D., Humml, M., Prucker, S., Schr\u00f6der, L., Strahlberger, A.: Generic model checking for modal fixpoint logics in COOL-MC. In: Dimitrova, R., Lahav, O., Wolff, S. (eds.) VMCAI 2024. LNCS, vol. 14499, pp. 171\u2013185. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-50524-9_8"},{"key":"2_CR13","unstructured":"Hausmann, D., Schr\u00f6der, L., Egger, C.: Global caching for the alternation-free $$\\mu $$-calculus. In: CONCUR. LIPIcs, vol.\u00a059, pp. 34:1\u201334:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-10003-2_79","volume-title":"Automata, Languages and Programming","author":"M Hennessy","year":"1980","unstructured":"Hennessy, M., Milner, R.: On observing nondeterminism and concurrency. In: de Bakker, J., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 299\u2013309. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10003-2_79"},{"key":"2_CR15","unstructured":"Kelly, M.: The basic concepts of enriched category theory. Reprints in Theory and Applications of Categories [electronic only] (2005)"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Klin, B.: Coalgebraic modal logic beyond sets. In: MFPS. Electronic Notes in Theoretical Computer Science, vol. 173, pp. 177\u2013201. Elsevier (2007)","DOI":"10.1016\/j.entcs.2007.02.034"},{"issue":"2","key":"2_CR17","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/0022-0000(85)90012-1","volume":"30","author":"D Kozen","year":"1985","unstructured":"Kozen, D.: A probabilistic PDL. J. Comput. Syst. Sci. 30(2), 162\u2013178 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0304-3975(81)90019-0","volume":"14","author":"D Kozen","year":"1981","unstructured":"Kozen, D., Parikh, R.: An elementary proof of the completness of PDL. Theor. Comput. Sci. 14, 113\u2013118 (1981)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Kupke, C., Kurz, A., Pattinson, D.: Algebraic semantics for coalgebraic logics. In: CMCS. Electronic Notes in Theoretical Computer Science, vol. 106, pp. 219\u2013241. Elsevier (2004)","DOI":"10.1016\/j.entcs.2004.02.037"},{"issue":"38","key":"2_CR20","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":"4","key":"2_CR21","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10485-011-9267-y","volume":"21","author":"A Kurz","year":"2013","unstructured":"Kurz, A., Velebil, J.: Enriched logical connections. Appl. Categorical Struct. 21(4), 349\u2013377 (2013)","journal-title":"Appl. Categorical Struct."},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-030-86059-2_22","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"J Marti","year":"2021","unstructured":"Marti, J., Venema, Y.: A focus system for the alternation-free $$\\mu $$-calculus. In: Das, A., Negri, S. (eds.) TABLEAUX 2021. LNCS (LNAI), vol. 12842, pp. 371\u2013388. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86059-2_22"},{"key":"2_CR23","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"},{"issue":"6","key":"2_CR24","doi-asserted-by":"publisher","first-page":"1268","DOI":"10.1016\/j.jlamp.2016.08.001","volume":"85","author":"J Rot","year":"2016","unstructured":"Rot, J., Bonsangue, M.M.: Structural congruence for bialgebraic semantics. J. Log. Algebr. Methods Program. 85(6), 1268\u20131291 (2016)","journal-title":"J. Log. Algebr. Methods Program."},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Rot, J., Jacobs, B., Levy, P.B.: Steps and traces. J. Log. Comput. 31(6), 1482\u20131525 (2021)","DOI":"10.1093\/logcom\/exab050"},{"key":"2_CR26","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":"2_CR27","doi-asserted-by":"crossref","unstructured":"Schr\u00f6der, L., Pattinson, D.: PSPACE bounds for rank-1 modal logics. ACM Trans. Comput. Log. 10(2), 13:1\u201313:33 (2009)","DOI":"10.1145\/1462179.1462185"},{"key":"2_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-642-15375-4_36","volume-title":"CONCUR 2010 - Concurrency Theory","author":"L Schr\u00f6der","year":"2010","unstructured":"Schr\u00f6der, L., Venema, Y.: Flat coalgebraic fixed point logics. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 524\u2013538. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15375-4_36"},{"issue":"4","key":"2_CR29","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/j.ic.2005.06.003","volume":"204","author":"Y Venema","year":"2006","unstructured":"Venema, Y.: Automata and fixed point logic: a coalgebraic perspective. Inf. Comput. 204(4), 637\u2013678 (2006)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Coalgebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-66438-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T07:08:59Z","timestamp":1721891339000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-66438-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031664373","9783031664380"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-66438-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"26 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CMCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Coalgebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","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":"6 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 April 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cmcs2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.coalg.org\/cmcs24\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}