{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:22:54Z","timestamp":1760080974289,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"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_6","type":"book-chapter","created":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T07:03:08Z","timestamp":1721890988000},"page":"114-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Graded Semantics and\u00a0Graded Logics for\u00a0Eilenberg-Moore Coalgebras"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5050-2565","authenticated-orcid":false,"given":"Jonas","family":"Forster","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3146-5906","authenticated-orcid":false,"given":"Lutz","family":"Schr\u00f6der","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9796-9675","authenticated-orcid":false,"given":"Paul","family":"Wild","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5256-1334","authenticated-orcid":false,"given":"Harsh","family":"Beohar","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0008-4343-1384","authenticated-orcid":false,"given":"Sebastian","family":"Gurke","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0003-1019-6449","authenticated-orcid":false,"given":"Karla","family":"Messing","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,26]]},"reference":[{"key":"6_CR1","unstructured":"Ad\u00e1mek, J., Herrlich, H., Strecker, G.: Abstract and Concrete Categories. Wiley Interscience: available as Reprints Theory Appl. Cat. 17(2006), 1\u2013507 (1990)"},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Baldan, P., Bonchi, F., Kerstan, H., K\u00f6nig, B.: Behavioral metrics via functor lifting. In: Raman, V., Suresh, S.P. (eds.) Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014. LIPIcs, vol.\u00a029, pp. 403\u2013415. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2014). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2014.403","DOI":"10.4230\/LIPIcs.FSTTCS.2014.403"},{"key":"6_CR3","unstructured":"Baldan, P., Bonchi, F., Kerstan, H., K\u00f6nig, B.: Coalgebraic behavioral metrics. Logical Methods Comput. Sci. 14(3) (2018), selected papers of the 6th Conference on Algebra and Coalgebra in Computer Science, CALCO 2015"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Beohar, H., Gurke, S., K\u00f6nig, B., Messing, K.: Hennessy-Milner theorems via Galois connections. In: Klin, B., Pimentel, E. (eds.) Computer Science Logic, CSL 2023. LIPIcs, vol.\u00a0252, pp. 12:1\u201312:18. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2023.12","DOI":"10.4230\/LIPIcs.CSL.2023.12"},{"key":"6_CR5","unstructured":"Beohar, H., Gurke, S., K\u00f6nig, B., Messing, K., Forster, J., Schr\u00f6der, L., Wild, P.: Expressive quantale-valued logics for coalgebras: an adjunction-based approach. In: Kupferman, O., Beyersdorff, O., Lokshtanov, D., Kant\u00e9, M.M. (eds.) Theoretical Aspects of Computer Science, STACS 2024. LIPIcs, Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2024), to appear"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Bonchi, F., Bonsangue, M., Caltais, G., Rutten, J., Silva, A.: Final semantics for decorated traces. In: Mathematical Foundations of Programming Semantics, MFPS 2012. ENTCS, vol.\u00a0286, pp. 73\u201386. Elsevier (2012). https:\/\/doi.org\/10.1016\/j.entcs.2012.08.006","DOI":"10.1016\/j.entcs.2012.08.006"},{"issue":"3\u20134","key":"6_CR7","doi-asserted-by":"publisher","first-page":"379","DOI":"10.3233\/FI-2017-1474","volume":"150","author":"C C\u00eerstea","year":"2017","unstructured":"C\u00eerstea, C.: From branching to linear time, coalgebraically. Fundam. Informaticae 150(3\u20134), 379\u2013406 (2017). https:\/\/doi.org\/10.3233\/FI-2017-1474","journal-title":"Fundam. Informaticae"},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"Dorsch, U., Milius, S., Schr\u00f6der, L.: Graded monads and graded logics for the linear time - branching time spectrum. In: Fokkink, W.J., van Glabbeek, R. (eds.) Concurrency Theory, CONCUR 2019. LIPIcs, vol.\u00a0140, pp. 36:1\u201336:16. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2019.36","DOI":"10.4230\/LIPIcs.CONCUR.2019.36"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Ford, C., Milius, S., Schr\u00f6der, L.: Behavioural preorders via graded monads. In: Logic in Computer Science, LICS 2021, pp. 1\u201313. IEEE (2021). https:\/\/doi.org\/10.1109\/LICS52264.2021.9470517","DOI":"10.1109\/LICS52264.2021.9470517"},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Ford, C., Milius, S., Schr\u00f6der, L., Beohar, H., K\u00f6nig, B.: Graded monads and behavioural equivalence games. In: Baier, C., Fisman, D. (eds.) Logic in Computer Science, LICS 2022, pp. 61:1\u201361:13. ACM (2022). https:\/\/doi.org\/10.1145\/3531130.3533374","DOI":"10.1145\/3531130.3533374"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Forster, J., Goncharov, S., Hofmann, D., Nora, P., Schr\u00f6der, L., Wild, P.: Quantitative Hennessy-Milner theorems via notions of density. In: Klin, B., Pimentel, E. (eds.) Computer Science Logic, CSL 2023. LIPIcs, vol.\u00a0252, pp. 22:1\u201322:20. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2023.22","DOI":"10.4230\/LIPIcs.CSL.2023.22"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Forster, J., Schr\u00f6der, L., Wild, P., Beohar, H., Gurke, S., Messing, K.: Graded semantics and graded logics for Eilenberg-Moore coalgebras. CoRR abs\/2307.14826 (2023). https:\/\/doi.org\/10.48550\/ARXIV.2307.14826","DOI":"10.48550\/ARXIV.2307.14826"},{"key":"6_CR13","unstructured":"van Glabbeek, R.: The linear time \u2013 branching time spectrum\u00a0I. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, chap.\u00a01, pp. 3\u201399. Elsevier (2001)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace semantics via coinduction. Log. Meth. Comput. Sci. 3 (2007)","DOI":"10.2168\/LMCS-3(4:11)2007"},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"Hennessy, M., Milner, R.: On observing nondeterminism and concurrency. In: de\u00a0Bakker, J.W., van Leeuwen, J. (eds.) Automata, Languages and Programming, ICALP 1980. LNCS, vol.\u00a085, pp. 299\u2013309. Springer (1980). https:\/\/doi.org\/10.1007\/3-540-10003-2_79","DOI":"10.1007\/3-540-10003-2_79"},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Jacobs, B.: Trace semantics for coalgebras. In: Ad\u00e1mek, J., Milius, S. (eds.) Coalgebraic Methods in Computer Science, CMCS 2004. ENTCS, vol.\u00a0106, pp. 167\u2013184. Elsevier (2004). https:\/\/doi.org\/10.1016\/j.entcs.2004.02.031","DOI":"10.1016\/j.entcs.2004.02.031"},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Jacobs, B.: Affine monads and side-effect-freeness. In: Hasuo, I. (ed.) Coalgebraic Methods in Computer Science, CMCS 2016. LNCS, vol.\u00a09608, pp. 53\u201372. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-40370-0_5","DOI":"10.1007\/978-3-319-40370-0_5"},{"issue":"5","key":"6_CR18","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). https:\/\/doi.org\/10.1016\/j.jcss.2014.12.005","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Kerstan, H., K\u00f6nig, B.: Coalgebraic trace semantics for continuous probabilistic transition systems. Log. Methods Comput. Sci. 9(4) (2013). https:\/\/doi.org\/10.2168\/LMCS-9(4:16)2013","DOI":"10.2168\/LMCS-9(4:16)2013"},{"key":"6_CR20","unstructured":"Kissig, C., Kurz, A.: Generic trace logics (2011), arXiv preprint 1103.3239"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-662-46678-0_10","volume-title":"Foundations of Software Science and Computation Structures","author":"B Klin","year":"2015","unstructured":"Klin, B., Rot, J.: Coalgebraic trace semantics via forgetful logics. In: Pitts, A. (ed.) FoSSaCS 2015. LNCS, vol. 9034, pp. 151\u2013166. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46678-0_10"},{"key":"6_CR22","doi-asserted-by":"publisher","unstructured":"Komorida, Y., Katsumata, S., Kupke, C., Rot, J., Hasuo, I.: Expressivity of quantitative modal logics : Categorical foundations via codensity and approximation. In: Logic in Computer Science, LICS 2021, pp. 1\u201314. IEEE (2021). https:\/\/doi.org\/10.1109\/LICS52264.2021.9470656","DOI":"10.1109\/LICS52264.2021.9470656"},{"key":"6_CR23","doi-asserted-by":"publisher","unstructured":"K\u00f6nig, B., Mika-Michalski, C.: (Metric) bisimulation games and real-valued modal logics for coalgebras. In: Schewe, S., Zhang, L. (eds.) Concurrency Theory, CONCUR 2018. LIPIcs, vol.\u00a0118, pp. 37:1\u201337:17. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2018.37","DOI":"10.4230\/LIPIcs.CONCUR.2018.37"},{"key":"6_CR24","doi-asserted-by":"publisher","unstructured":"Kupke, C., Rot, J.: Expressive logics for coinductive predicates. Log. Methods Comput. Sci. 17(4) (2021). https:\/\/doi.org\/10.46298\/lmcs-17(4:19)2021","DOI":"10.46298\/lmcs-17(4:19)2021"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-319-15545-6_8","volume-title":"Software, Services, and Systems","author":"A Kurz","year":"2015","unstructured":"Kurz, A., Milius, S., Pattinson, D., Schr\u00f6der, L.: Simplified coalgebraic trace equivalence. In: De Nicola, R., Hennicker, R. (eds.) Software, Services, and Systems. LNCS, vol. 8950, pp. 75\u201390. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15545-6_8"},{"key":"6_CR26","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF02924844","volume":"43","author":"FW Lawvere","year":"1973","unstructured":"Lawvere, F.W.: Metric spaces, generalized logic, and closed categories. Rendiconti del seminario mat\u00e9matico e fisico di Milano 43, 135\u2013166 (1973)","journal-title":"Rendiconti del seminario mat\u00e9matico e fisico di Milano"},{"issue":"5","key":"6_CR27","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1016\/j.jcss.2014.12.006","volume":"81","author":"J Marti","year":"2015","unstructured":"Marti, J., Venema, Y.: Lax extensions of coalgebra functors and their logic. J. Comput. Syst. Sci. 81(5), 880\u2013900 (2015). https:\/\/doi.org\/10.1016\/j.jcss.2014.12.006","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR28","doi-asserted-by":"publisher","unstructured":"Milius, S., Pattinson, D., Schr\u00f6der, L.: Generic trace semantics and graded monads. In: Moss, L.S., Sobocinski, P. (eds.) Algebra and Coalgebra in Computer Science, CALCO 2015. LIPIcs, vol.\u00a035, pp. 253\u2013269. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2015). https:\/\/doi.org\/10.4230\/LIPIcs.CALCO.2015.253","DOI":"10.4230\/LIPIcs.CALCO.2015.253"},{"issue":"1\u20132","key":"6_CR29","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0304-3975(00)00338-8","volume":"278","author":"PS Mulry","year":"2002","unstructured":"Mulry, P.S.: Lifting results for categories of algebras. Theor. Comput. Sci. 278(1\u20132), 257\u2013269 (2002). https:\/\/doi.org\/10.1016\/S0304-3975(00)00338-8","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"6_CR30","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1305\/ndjfl\/1094155277","volume":"45","author":"D Pattinson","year":"2004","unstructured":"Pattinson, D.: Expressive logics for coalgebras via terminal sequence induction. Notre Dame J. Formal Log. 45(1), 19\u201333 (2004). https:\/\/doi.org\/10.1305\/ndjfl\/1094155277","journal-title":"Notre Dame J. Formal Log."},{"issue":"6","key":"6_CR31","doi-asserted-by":"publisher","first-page":"1482","DOI":"10.1093\/logcom\/exab050","volume":"31","author":"J Rot","year":"2021","unstructured":"Rot, J., Jacobs, B., Levy, P.B.: Steps and traces. J. Log. Comput. 31(6), 1482\u20131525 (2021). https:\/\/doi.org\/10.1093\/logcom\/exab050","journal-title":"J. Log. Comput."},{"issue":"1","key":"6_CR32","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). https:\/\/doi.org\/10.1016\/S0304-3975(00)00056-6","journal-title":"Theor. Comput. Sci."},{"issue":"2\u20133","key":"6_CR33","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). https:\/\/doi.org\/10.1016\/j.tcs.2007.09.023","journal-title":"Theor. Comput. Sci."},{"key":"6_CR34","doi-asserted-by":"publisher","unstructured":"Silva, A., Bonchi, F., Bonsangue, M.M., Rutten, J.J.M.M.: Generalizing the powerset construction, coalgebraically. In: Lodaya, K., Mahajan, M. (eds.) Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010. LIPIcs, vol.\u00a08, pp. 272\u2013283. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2010). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2010.272","DOI":"10.4230\/LIPIcs.FSTTCS.2010.272"},{"key":"6_CR35","doi-asserted-by":"publisher","first-page":"3032","DOI":"10.1007\/s10958-008-9013-7","volume":"151","author":"A Smirnov","year":"2008","unstructured":"Smirnov, A.: Graded monads and rings of polynomials. J. Math. Sci. 151, 3032\u20133051 (2008)","journal-title":"J. Math. Sci."},{"key":"6_CR36","doi-asserted-by":"publisher","unstructured":"Sokolova, A., Woracek, H.: Termination in convex sets of distributions. Log. Methods Comput. Sci. 14(4) (2018). https:\/\/doi.org\/10.23638\/LMCS-14(4:17)2018","DOI":"10.23638\/LMCS-14(4:17)2018"},{"key":"6_CR37","doi-asserted-by":"publisher","unstructured":"Urabe, N., Hasuo, I.: Coalgebraic infinite traces and Kleisli simulations. In: Moss, L.S., Sobocinski, P. (eds.) Algebra and Coalgebra in Computer Science, CALCO 2015. LIPIcs, vol.\u00a035, pp. 320\u2013335. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2015). https:\/\/doi.org\/10.4230\/LIPIcs.CALCO.2015.320","DOI":"10.4230\/LIPIcs.CALCO.2015.320"},{"key":"6_CR38","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2004.09.035","volume":"331","author":"F van Breugel","year":"2005","unstructured":"van Breugel, F., Worrell, J.: A behavioural pseudometric for probabilistic transition systems. Theoret. Comput. Sci. 331, 115\u2013142 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR39","doi-asserted-by":"publisher","unstructured":"Wild, P., Schr\u00f6der, L.: Characteristic logics for behavioural hemimetrics via fuzzy lax extensions. Log. Methods Comput. Sci. 18(2) (2022). https:\/\/doi.org\/10.46298\/lmcs-18(2:19)2022","DOI":"10.46298\/lmcs-18(2:19)2022"},{"key":"6_CR40","doi-asserted-by":"publisher","unstructured":"Worrell, J.: Coinduction for recursive data types: partial orders, metric spaces and omega-categories. In: Reichel, H. (ed.) Coalgebraic Methods in Computer Science, CMCS 2000. ENTCS, vol.\u00a033, pp. 337\u2013356. Elsevier (2000). https:\/\/doi.org\/10.1016\/S1571-0661(05)80356-1","DOI":"10.1016\/S1571-0661(05)80356-1"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T07:09:23Z","timestamp":1721891363000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-66438-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031664373","9783031664380"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-66438-0_6","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"}}]}}