{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:19:01Z","timestamp":1760080741004,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T00:00:00Z","timestamp":1659398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["393541319\/GRK2475\/1-2019,434050016,419850228"],"award-info":[{"award-number":["393541319\/GRK2475\/1-2019,434050016,419850228"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,2]]},"DOI":"10.1145\/3531130.3533374","type":"proceedings-article","created":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T20:23:38Z","timestamp":1659644618000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Graded Monads and Behavioural Equivalence Games"],"prefix":"10.1145","author":[{"given":"Chase","family":"Ford","sequence":"first","affiliation":[{"name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg, Germany"}]},{"given":"Stefan","family":"Milius","sequence":"additional","affiliation":[{"name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg, Germany"}]},{"given":"Lutz","family":"Schr\u00f6der","sequence":"additional","affiliation":[{"name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg, Germany"}]},{"given":"Harsh","family":"Beohar","sequence":"additional","affiliation":[{"name":"The University of Sheffield, United Kingdom"}]},{"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Duisburg-Essen, Germany"}]}],"member":"320","published-online":{"date-parts":[[2022,8,4]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"LICS 2017","author":"Abramsky Samson","year":"2017","unstructured":"Samson Abramsky , Anuj Dawar , and Pengming Wang . 2017 . The Pebbling Comonad in Finite Model Theory. In Logic in Computer Science , LICS 2017 . IEEE, 1\u201312. https:\/\/doi.org\/10.1109\/LICS.2017.8005129 10.1109\/LICS.2017.8005129 Samson Abramsky, Anuj Dawar, and Pengming Wang. 2017. The Pebbling Comonad in Finite Model Theory. In Logic in Computer Science, LICS 2017. IEEE, 1\u201312. https:\/\/doi.org\/10.1109\/LICS.2017.8005129"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00389-0_1"},{"key":"e_1_3_2_1_3_1","volume-title":"CTCS 1989(LNCS), David\u00a0H. Pitt, David\u00a0E. Rydeheard, Peter Dybjer, Andrew\u00a0M. Pitts, and Axel Poign\u00e9 (Eds.). Vol.\u00a0389","author":"Aczel Peter","year":"1989","unstructured":"Peter Aczel and Nax\u00a0Paul Mendler . 1989 . A Final Coalgebra Theorem. In Category Theory and Computer Science , CTCS 1989(LNCS), David\u00a0H. Pitt, David\u00a0E. Rydeheard, Peter Dybjer, Andrew\u00a0M. Pitts, and Axel Poign\u00e9 (Eds.). Vol.\u00a0389 . Springer, 357\u2013365. https:\/\/doi.org\/10.1007\/BFb00 18361 10.1007\/BFb0018361 Peter Aczel and Nax\u00a0Paul Mendler. 1989. A Final Coalgebra Theorem. In Category Theory and Computer Science, CTCS 1989(LNCS), David\u00a0H. Pitt, David\u00a0E. Rydeheard, Peter Dybjer, Andrew\u00a0M. Pitts, and Axel Poign\u00e9 (Eds.). Vol.\u00a0389. Springer, 357\u2013365. https:\/\/doi.org\/10.1007\/BFb0018361"},{"volume-title":"Abstract and Concrete Categories","author":"Ad\u00e1mek Ji\u0159\u00ed","key":"e_1_3_2_1_4_1","unstructured":"Ji\u0159\u00ed Ad\u00e1mek , Horst Herrlich , and George Strecker . 1990. Abstract and Concrete Categories . Wiley-Interscience , New York . Ji\u0159\u00ed Ad\u00e1mek, Horst Herrlich, and George Strecker. 1990. Abstract and Concrete Categories. Wiley-Interscience, New York."},{"key":"e_1_3_2_1_5_1","unstructured":"Ji\u0159\u00ed Ad\u00e1mek Stefan Milius Lurdes Sousa and Thorsten Wi\u00dfmann. 2019. On Finitary Functors. Theory Appl.\u00a0Categ. 34(2019) 1134\u20131164.  Ji\u0159\u00ed Ad\u00e1mek Stefan Milius Lurdes Sousa and Thorsten Wi\u00dfmann. 2019. On Finitary Functors. Theory Appl.\u00a0Categ. 34(2019) 1134\u20131164."},{"volume-title":"Locally Presentable and Accessible Categories","author":"Ad\u00e1mek Ji\u0159\u00ed","key":"e_1_3_2_1_6_1","unstructured":"Ji\u0159\u00ed Ad\u00e1mek and Ji\u0159\u00ed Rosick\u00fd . 1994. Locally Presentable and Accessible Categories . Cambridge University Press . https:\/\/doi.org\/10.1017\/CBO9780511600579 10.1017\/CBO9780511600579 Ji\u0159\u00ed Ad\u00e1mek and Ji\u0159\u00ed Rosick\u00fd. 1994. Locally Presentable and Accessible Categories. Cambridge University Press. https:\/\/doi.org\/10.1017\/CBO9780511600579"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.03.021"},{"key":"e_1_3_2_1_8_1","first-page":"1860","article-title":"Coalgebraic Behavioral Metrics","volume":"14","author":"Baldan Paolo","year":"2018","unstructured":"Paolo Baldan , Filippo Bonchi , Henning Kerstan , and Barbara K\u00f6nig . 2018 . Coalgebraic Behavioral Metrics . Log. Methods Comput. Sci. 14 , 3 (2018), 1860 \u2013 5974 . https:\/\/doi.org\/10.23638\/lmcs-14(3:20)2018 10.23638\/lmcs-14(3:20)2018 Paolo Baldan, Filippo Bonchi, Henning Kerstan, and Barbara K\u00f6nig. 2018. Coalgebraic Behavioral Metrics. Log. Methods Comput. Sci. 14, 3 (2018), 1860\u20135974. https:\/\/doi.org\/10.23638\/lmcs-14(3:20)2018","journal-title":"Log. Methods Comput. Sci."},{"key":"e_1_3_2_1_9_1","volume-title":"CMCS 2000(ENTCS), Horst Reichel (Ed.). Vol.\u00a033","author":"Baltag Alexandru","year":"2000","unstructured":"Alexandru Baltag . 2000 . A Logic for Coalgebraic Simulation. In Coalgebraic Methods in Computer Science , CMCS 2000(ENTCS), Horst Reichel (Ed.). Vol.\u00a033 . Elsevier, 42\u201360. https:\/\/doi.org\/10.1016\/S1571-0661(05)80343-3 10.1016\/S1571-0661(05)80343-3 Alexandru Baltag. 2000. A Logic for Coalgebraic Simulation. In Coalgebraic Methods in Computer Science, CMCS 2000(ENTCS), Horst Reichel (Ed.). Vol.\u00a033. Elsevier, 42\u201360. https:\/\/doi.org\/10.1016\/S1571-0661(05)80343-3"},{"key":"#cr-split#-e_1_3_2_1_10_1.1","unstructured":"Harsh Beohar Chase Ford Barbara K\u00f6nig Stefan Milius and Lutz Schr\u00f6der. 2022. Graded Monads and Behavioural Equivalence Games. https:\/\/doi.org\/10.48550\/ARXIV.2203.15467 10.48550\/ARXIV.2203.15467"},{"key":"#cr-split#-e_1_3_2_1_10_1.2","unstructured":"Harsh Beohar Chase Ford Barbara K\u00f6nig Stefan Milius and Lutz Schr\u00f6der. 2022. Graded Monads and Behavioural Equivalence Games. https:\/\/doi.org\/10.48550\/ARXIV.2203.15467"},{"key":"e_1_3_2_1_11_1","volume-title":"TACAS","author":"Bonchi Filippo","year":"2017","unstructured":"Filippo Bonchi , Barbara K\u00f6nig , and Sebastian K\u00fcpper . 2017 . Up-To Techniques for Weighted Systems. In Tools and Algorithms for the Construction and Analysis of Systems - 23rd International Conference , TACAS 2017. Springer, 535\u2013552. https:\/\/doi.org\/10.1007\/978-3-662-54577-5_31 10.1007\/978-3-662-54577-5_31 Filippo Bonchi, Barbara K\u00f6nig, and Sebastian K\u00fcpper. 2017. Up-To Techniques for Weighted Systems. In Tools and Algorithms for the Construction and Analysis of Systems - 23rd International Conference, TACAS 2017. Springer, 535\u2013552. https:\/\/doi.org\/10.1007\/978-3-662-54577-5_31"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429124"},{"key":"e_1_3_2_1_13_1","volume-title":"Sound and complete axiomatizations of coalgebraic language equivalence. ACM Trans.\u00a0Comput.\u00a0Log. 14, 1:7","author":"Bonsangue M.","year":"2013","unstructured":"Marcello\u00a0 M. Bonsangue , Stefan Milius , and Alexandra Silva . 2013. Sound and complete axiomatizations of coalgebraic language equivalence. ACM Trans.\u00a0Comput.\u00a0Log. 14, 1:7 ( 2013 ), 52 pp. Marcello\u00a0M. Bonsangue, Stefan Milius, and Alexandra Silva. 2013. Sound and complete axiomatizations of coalgebraic language equivalence. ACM Trans.\u00a0Comput.\u00a0Log. 14, 1:7 (2013), 52 pp."},{"key":"e_1_3_2_1_14_1","volume-title":"APLAS 2008(LNCS). Springer, 107\u2013121","author":"Chen Xin","year":"2008","unstructured":"Xin Chen and Yuxin Deng . 2008 . Game Characterizations of Process Equivalences. In Programming Languages and Systems , APLAS 2008(LNCS). Springer, 107\u2013121 . https:\/\/doi.org\/10.1007\/978-3-540-89330-1_8 10.1007\/978-3-540-89330-1_8 Xin Chen and Yuxin Deng. 2008. Game Characterizations of Process Equivalences. In Programming Languages and Systems, APLAS 2008(LNCS). Springer, 107\u2013121. https:\/\/doi.org\/10.1007\/978-3-540-89330-1_8"},{"key":"e_1_3_2_1_15_1","volume-title":"CONCUR 2019(LIPIcs), Wan\u00a0J. Fokkink and Rob van Glabbeek (Eds.). Vol.\u00a0140","author":"Dorsch Ulrich","year":"2019","unstructured":"Ulrich Dorsch , Stefan Milius , and Lutz Schr\u00f6der . 2019 . Graded Monads and Graded Logics for the Linear Time - Branching Time Spectrum. In Concurrency Theory , CONCUR 2019(LIPIcs), Wan\u00a0J. Fokkink and Rob van Glabbeek (Eds.). Vol.\u00a0140 . Leibniz-Zentrum f\u00fcr Informatik, 36:1\u201336:16. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR. 2019.36 10.4230\/LIPIcs.CONCUR.2019.36 Ulrich Dorsch, Stefan Milius, and Lutz Schr\u00f6der. 2019. Graded Monads and Graded Logics for the Linear Time - Branching Time Spectrum. In Concurrency Theory, CONCUR 2019(LIPIcs), Wan\u00a0J. Fokkink and Rob van Glabbeek (Eds.). Vol.\u00a0140. Leibniz-Zentrum f\u00fcr Informatik, 36:1\u201336:16. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2019.36"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.07.030"},{"key":"e_1_3_2_1_17_1","volume-title":"FSTTCS 2011(LIPIcs), Vol.\u00a013","author":"Fahrenberg Uli","year":"2011","unstructured":"Uli Fahrenberg , Axel Legay , and Claus Thrane . 2011 . The Quantitative Linear-Time\u2013Branching-Time Spectrum. In Foundations of Software Technology and Theoretical Computer Science , FSTTCS 2011(LIPIcs), Vol.\u00a013 . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 103\u2013114. https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS. 2011.103 10.4230\/LIPIcs.FSTTCS.2011.103 Uli Fahrenberg, Axel Legay, and Claus Thrane. 2011. The Quantitative Linear-Time\u2013Branching-Time Spectrum. In Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011(LIPIcs), Vol.\u00a013. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 103\u2013114. https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2011.103"},{"key":"e_1_3_2_1_18_1","volume-title":"LICS 2021","author":"Ford Chase","year":"2021","unstructured":"Chase Ford , Stefan Milius , and Lutz Schr\u00f6der . 2021 . Behavioural Preorders via Graded Monads. In Logic in Computer Science , LICS 2021 , Leonid Libkin (Ed.). IEEE, 1\u201313. https:\/\/doi.org\/10.1109\/LICS52264. 2021.9470517 10.1109\/LICS52264.2021.9470517 Chase Ford, Stefan Milius, and Lutz Schr\u00f6der. 2021. Behavioural Preorders via Graded Monads. In Logic in Computer Science, LICS 2021, Leonid Libkin (Ed.). IEEE, 1\u201313. https:\/\/doi.org\/10.1109\/LICS52264.2021.9470517"},{"key":"e_1_3_2_1_19_1","volume-title":"FOSSACS 2016(LNCS), Bart Jacobs and Christof L\u00f6ding (Eds.). Vol.\u00a09634","author":"Fujii Soichiro","year":"2016","unstructured":"Soichiro Fujii , Shin ya Katsumata , and P.\u00a0- Andr\u00e9 Melli\u00e8s . 2016 . Towards a Formal Theory of Graded Monads. In Foundations of Software Science and Computation Structures , FOSSACS 2016(LNCS), Bart Jacobs and Christof L\u00f6ding (Eds.). Vol.\u00a09634 . Springer, 513\u2013530. https:\/\/doi.org\/10.1007\/978-3-662-49630-5_30 10.1007\/978-3-662-49630-5_30 Soichiro Fujii, Shin ya Katsumata, and P.\u00a0-Andr\u00e9 Melli\u00e8s. 2016. Towards a Formal Theory of Graded Monads. In Foundations of Software Science and Computation Structures, FOSSACS 2016(LNCS), Bart Jacobs and Christof L\u00f6ding (Eds.). Vol.\u00a09634. Springer, 513\u2013530. https:\/\/doi.org\/10.1007\/978-3-662-49630-5_30"},{"key":"e_1_3_2_1_20_1","volume-title":"CONCUR 1990(LNCS), Jos Baeten and Jan\u00a0Willem Klop (Eds.). Vol.\u00a0458","author":"van Glabbeek Rob","year":"1990","unstructured":"Rob van Glabbeek . 1990 . The Linear Time-Branching Time Spectrum (Extended Abstract). In Theories of Concurrency , CONCUR 1990(LNCS), Jos Baeten and Jan\u00a0Willem Klop (Eds.). Vol.\u00a0458 . Springer, 278\u2013297. https:\/\/doi.org\/10.1007\/BFb0039066 10.1007\/BFb0039066 Rob van Glabbeek. 1990. The Linear Time-Branching Time Spectrum (Extended Abstract). In Theories of Concurrency, CONCUR 1990(LNCS), Jos Baeten and Jan\u00a0Willem Klop (Eds.). Vol.\u00a0458. Springer, 278\u2013297. https:\/\/doi.org\/10.1007\/BFb0039066"},{"key":"e_1_3_2_1_21_1","volume-title":"CALCO 2013(LNCS), Reiko Heckel and Stefan Milius (Eds.). Vol.\u00a08089","author":"Gor\u00edn Daniel","year":"2013","unstructured":"Daniel Gor\u00edn and Lutz Schr\u00f6der . 2013 . Simulations and Bisimulations for Coalgebraic Modal Logics. In Algebra and Coalgebra in Computer Science , CALCO 2013(LNCS), Reiko Heckel and Stefan Milius (Eds.). Vol.\u00a08089 . Springer, 253\u2013266. https:\/\/doi.org\/10.1007\/978-3-642-40206-7_19 10.1007\/978-3-642-40206-7_19 Daniel Gor\u00edn and Lutz Schr\u00f6der. 2013. Simulations and Bisimulations for Coalgebraic Modal Logics. In Algebra and Coalgebra in Computer Science, CALCO 2013(LNCS), Reiko Heckel and Stefan Milius (Eds.). Vol.\u00a08089. Springer, 253\u2013266. https:\/\/doi.org\/10.1007\/978-3-642-40206-7_19"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-3(4:11)2007"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s100090100041"},{"key":"e_1_3_2_1_24_1","volume-title":"FSTTCS 1998(LNCS), Vol.\u00a01530","author":"Huhn Michaela","year":"1998","unstructured":"Michaela Huhn , Peter Niebert , and Heike Wehrheim . 1998 . Partial Order Reductions for Bisimulation Checking. In Foundations of Software Technology and Theoretical Computer Science , FSTTCS 1998(LNCS), Vol.\u00a01530 . Springer, 271\u2013282. https:\/\/doi.org\/10.1007\/978-3-540-49382-2_26 10.1007\/978-3-540-49382-2_26 Michaela Huhn, Peter Niebert, and Heike Wehrheim. 1998. Partial Order Reductions for Bisimulation Checking. In Foundations of Software Technology and Theoretical Computer Science, FSTTCS 1998(LNCS), Vol.\u00a01530. Springer, 271\u2013282. https:\/\/doi.org\/10.1007\/978-3-540-49382-2_26"},{"key":"e_1_3_2_1_25_1","volume-title":"CMCS 2018(LNCS), Corina C\u00eerstea (Ed.). Vol.\u00a011202","author":"Jacobs Bart","year":"2018","unstructured":"Bart Jacobs , Paul Levy , and Jurriaan Rot . 2018 . Steps and Traces. In Coalgebraic Methods in Computer Science , CMCS 2018(LNCS), Corina C\u00eerstea (Ed.). Vol.\u00a011202 . Springer, 122\u2013143. https:\/\/doi.org\/10.1007\/978-3-030-00389-0_8 10.1007\/978-3-030-00389-0_8 Bart Jacobs, Paul Levy, and Jurriaan Rot. 2018. Steps and Traces. In Coalgebraic Methods in Computer Science, CMCS 2018(LNCS), Corina C\u00eerstea (Ed.). Vol.\u00a011202. Springer, 122\u2013143. https:\/\/doi.org\/10.1007\/978-3-030-00389-0_8"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2014.12.005"},{"key":"e_1_3_2_1_27_1","volume-title":"CONCUR 1990(LNCS), Jos Baeten and Jan Klop (Eds.). Vol.\u00a0458","author":"Jou Chi-Chang","year":"1990","unstructured":"Chi-Chang Jou and Scott Smolka . 1990 . Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes. In Theories of Concurrency: Unification and Extension , CONCUR 1990(LNCS), Jos Baeten and Jan Klop (Eds.). Vol.\u00a0458 . Springer, 367\u2013383. https:\/\/doi.org\/10.1007\/BFb0039045 10.1007\/BFb0039045 Chi-Chang Jou and Scott Smolka. 1990. Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes. In Theories of Concurrency: Unification and Extension, CONCUR 1990(LNCS), Jos Baeten and Jan Klop (Eds.). Vol.\u00a0458. Springer, 367\u2013383. https:\/\/doi.org\/10.1007\/BFb0039045"},{"key":"e_1_3_2_1_28_1","volume-title":"Advances in Modal Logic, AiML","author":"Kapulkin Krysztof","year":"2012","unstructured":"Krysztof Kapulkin , Alexander Kurz , and Ji\u0159\u00ed Velebil . 2012. Expressiveness of Positive Coalgebraic Logic . In Advances in Modal Logic, AiML 2012 . College Publications , 368\u2013385. http:\/\/www.aiml.net\/volumes\/volume9\/Kapulkin-Kurz-Velebil.pdf Krysztof Kapulkin, Alexander Kurz, and Ji\u0159\u00ed Velebil. 2012. Expressiveness of Positive Coalgebraic Logic. In Advances in Modal Logic, AiML 2012. College Publications, 368\u2013385. http:\/\/www.aiml.net\/volumes\/volume9\/Kapulkin-Kurz-Velebil.pdf"},{"volume-title":"POPL","year":"2014","key":"e_1_3_2_1_29_1","unstructured":"Shin-ya Katsumata. 2014 . Parametric effect monads and semantics of effect systems. In Principles of Programming Languages , POPL 2014, Suresh Jagannathan and Peter Sewell (Eds.). ACM, 633\u2013646. https:\/\/doi.org\/10.1145\/2535838.2535846 10.1145\/2535838.2535846 Shin-ya Katsumata. 2014. Parametric effect monads and semantics of effect systems. In Principles of Programming Languages, POPL 2014, Suresh Jagannathan and Peter Sewell (Eds.). ACM, 633\u2013646. https:\/\/doi.org\/10.1145\/2535838.2535846"},{"volume-title":"Foundations of Software Science and Computation Structures, FoSSaCS 2015(LNCS), Andrew Pitts (Ed.). Vol.\u00a09034","author":"Klin Bartek","key":"e_1_3_2_1_30_1","unstructured":"Bartek Klin and Jurriaan Rot . 2015. Coalgebraic Trace Semantics via Forgetful Logics . In Foundations of Software Science and Computation Structures, FoSSaCS 2015(LNCS), Andrew Pitts (Ed.). Vol.\u00a09034 . Springer , 151\u2013166. https:\/\/doi.org\/10.1007\/978-3-662-46678-0 10.1007\/978-3-662-46678-0 Bartek Klin and Jurriaan Rot. 2015. Coalgebraic Trace Semantics via Forgetful Logics. In Foundations of Software Science and Computation Structures, FoSSaCS 2015(LNCS), Andrew Pitts (Ed.). Vol.\u00a09034. Springer, 151\u2013166. https:\/\/doi.org\/10.1007\/978-3-662-46678-0"},{"key":"e_1_3_2_1_31_1","volume-title":"LICS 2019","author":"Komorida Yuichi","year":"2019","unstructured":"Yuichi Komorida , Shin-ya Katsumata, Nick Hu , Bartek Klin , and Ichiro Hasuo . 2019 . Codensity Games for Bisimilarity. In Logic in Computer Science , LICS 2019 . IEEE, 1\u201313. https:\/\/doi.org\/10.1109\/LICS.2019.8785691 10.1109\/LICS.2019.8785691 Yuichi Komorida, Shin-ya Katsumata, Nick Hu, Bartek Klin, and Ichiro Hasuo. 2019. Codensity Games for Bisimilarity. In Logic in Computer Science, LICS 2019. IEEE, 1\u201313. https:\/\/doi.org\/10.1109\/LICS.2019.8785691"},{"key":"e_1_3_2_1_32_1","volume-title":"CONCUR 2018(LIPIcs), Vol.\u00a0118","author":"K\u00f6nig Barbara","year":"2018","unstructured":"Barbara K\u00f6nig and Christina Mika-Michalski . 2018 . (Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras. In Concurrency Theory , CONCUR 2018(LIPIcs), Vol.\u00a0118 . Schloss Dagstuhl \u2013 Leibniz Center for Informatics, 37:1\u201337:17. http:\/\/drops.dagstuhl.de\/opus\/frontdoor.php?source_opus=9575 Barbara K\u00f6nig and Christina Mika-Michalski. 2018. (Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras. In Concurrency Theory, CONCUR 2018(LIPIcs), Vol.\u00a0118. Schloss Dagstuhl \u2013 Leibniz Center for Informatics, 37:1\u201337:17. http:\/\/drops.dagstuhl.de\/opus\/frontdoor.php?source_opus=9575"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2934518"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129515000328"},{"key":"e_1_3_2_1_35_1","volume-title":"CALCO 2015(LIPIcs), Lawrence\u00a0S. Moss and Pawel Sobocinski (Eds.). Vol.\u00a035","author":"Milius Stefan","year":"2015","unstructured":"Stefan Milius , Dirk Pattinson , and Lutz Schr\u00f6der . 2015 . Generic Trace Semantics and Graded Monads. In Algebra and Coalgebra in Computer Science , CALCO 2015(LIPIcs), Lawrence\u00a0S. Moss and Pawel Sobocinski (Eds.). Vol.\u00a035 . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 253\u2013269. https:\/\/doi.org\/10.4230\/LIPIcs.CALCO. 2015.253 10.4230\/LIPIcs.CALCO.2015.253 Stefan Milius, Dirk Pattinson, and Lutz Schr\u00f6der. 2015. Generic Trace Semantics and Graded Monads. In Algebra and Coalgebra in Computer Science, CALCO 2015(LIPIcs), Lawrence\u00a0S. Moss and Pawel Sobocinski (Eds.). Vol.\u00a035. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 253\u2013269. https:\/\/doi.org\/10.4230\/LIPIcs.CALCO.2015.253"},{"key":"e_1_3_2_1_36_1","volume-title":"CSL 2021(LIPIcs), Vol.\u00a0183","author":"\u00d3\u00a0Conghaile Adam","year":"2021","unstructured":"Adam \u00d3\u00a0Conghaile and Anuj Dawar . 2021 . Game Comonads & Generalised Quantifiers. In Computer Science Logic , CSL 2021(LIPIcs), Vol.\u00a0183 . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 16:1\u201316:17. https:\/\/doi.org\/10.4230\/LIPIcs.CSL. 2021.16 10.4230\/LIPIcs.CSL.2021.16 Adam \u00d3\u00a0Conghaile and Anuj Dawar. 2021. Game Comonads & Generalised Quantifiers. In Computer Science Logic, CSL 2021(LIPIcs), Vol.\u00a0183. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 16:1\u201316:17. https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2021.16"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00056-6"},{"key":"e_1_3_2_1_38_1","volume-title":"\u00a0M. Rutten","author":"Silva Alexandra","year":"2013","unstructured":"Alexandra Silva , Filippo Bonchi , Marcello\u00a0 M. Bonsangue , and Jan J. M . \u00a0M. Rutten . 2013 . Generalizing determinization from automata to coalgebras. Log. Methods Comput. Sci . 9, 1 (2013), 9:1\u201327. https:\/\/doi.org\/10.2168\/LMCS-9(1:9)2013 10.2168\/LMCS-9(1:9)2013 Alexandra Silva, Filippo Bonchi, Marcello\u00a0M. Bonsangue, and Jan J. M.\u00a0M. Rutten. 2013. Generalizing determinization from automata to coalgebras. Log. Methods Comput. Sci. 9, 1 (2013), 9:1\u201327. https:\/\/doi.org\/10.2168\/LMCS-9(1:9)2013"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10958-008-9013-7"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1093\/jigpal\/7.1.103"},{"key":"e_1_3_2_1_41_1","volume-title":"CONCUR 2020(LIPIcs), Igor Konnov and Laura Kov\u00e1cs (Eds.). Vol.\u00a0171","author":"Wild Paul","year":"2020","unstructured":"Paul Wild and Lutz Schr\u00f6der . 2020 . Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions. In Concurrency Theory , CONCUR 2020(LIPIcs), Igor Konnov and Laura Kov\u00e1cs (Eds.). Vol.\u00a0171 . Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, 27:1\u201327:23. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR. 2020.27 arXiv:cs.LO\/2007.01033 10.4230\/LIPIcs.CONCUR.2020.27 Paul Wild and Lutz Schr\u00f6der. 2020. Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions. In Concurrency Theory, CONCUR 2020(LIPIcs), Igor Konnov and Laura Kov\u00e1cs (Eds.). Vol.\u00a0171. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, 27:1\u201327:23. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2020.27 arXiv:cs.LO\/2007.01033"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.12.009"}],"event":{"name":"LICS '22: 37th Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation"],"location":"Haifa Israel","acronym":"LICS '22"},"container-title":["Proceedings of the 37th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3533374","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3531130.3533374","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:10Z","timestamp":1750186930000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3533374"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,2]]},"references-count":43,"alternative-id":["10.1145\/3531130.3533374","10.1145\/3531130"],"URL":"https:\/\/doi.org\/10.1145\/3531130.3533374","relation":{},"subject":[],"published":{"date-parts":[[2022,8,2]]},"assertion":[{"value":"2022-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}