{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:20:37Z","timestamp":1776316837267,"version":"3.50.1"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1109\/lics.2019.8785691","type":"proceedings-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T01:15:55Z","timestamp":1565054155000},"page":"1-13","source":"Crossref","is-referenced-by-count":12,"title":["Codensity Games for Bisimilarity"],"prefix":"10.1109","author":[{"given":"Yuichi","family":"Komorida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin-ya","family":"Katsumata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bartek","family":"Klin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ichiro","family":"Hasuo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703420675"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2935319"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.03.047"},{"key":"ref10","first-page":"37: 1","article-title":"(Metric) bisimulation games and real-valued modal logics for coalgebras","author":"k\u00f6nig","year":"2018","journal-title":"29th International Conference on Concurrency Theory CONCUR 2018"},{"key":"ref11","first-page":"17: 1","article-title":"Up-to techniques for behavioural metrics via fibrations","volume":"118","author":"bonchi","year":"2018","journal-title":"29th International Conference on Concurrency Theory CONCUR 2018"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/978-3-030-17127-8_30","article-title":"Path category for free","author":"wi?mann","year":"2019","journal-title":"Foundations of Software Science and Computation Structures"},{"key":"ref13","first-page":"105: 1","article-title":"Expressiveness of Probabilistic Modal Logics, Revisited","volume":"80","author":"fijalkow","year":"2017","journal-title":"Procs ICALP 2017 ser Leibniz International Proceedings in Informatics (LIPIcs)"},{"key":"ref14","article-title":"Codensity lifting of monads and its dual","volume":"14","author":"katsumata","year":"2018","journal-title":"Logical Methods in Computer Science"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00389-0_11"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/QEST.2008.42"},{"key":"ref17","article-title":"Coden-sity games for bisimilarity","author":"komorida","year":"2019","journal-title":"extended version with appendices"},{"key":"ref18","author":"jacobs","year":"1999","journal-title":"Categorical Logic and Type Theory"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0057"},{"key":"ref28","author":"ad\u00e1mek","year":"1990","journal-title":"Abstract and concrete categories"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90030-6"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0016-660X(74)90016-6"},{"key":"ref3","author":"sangiorgi","year":"2011","journal-title":"Advanced Topics in Bisimulation and Coinduction"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2725"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2009.01.002"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2003.09.013"},{"key":"ref8","article-title":"Coalgebraic behavioral metrics","volume":"14","author":"baldan","year":"2018","journal-title":"Logical Methods in Computer Science"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129517000056"},{"key":"ref2","author":"milner","year":"1989","journal-title":"Communication and Concurrency"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2603088.2603149"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017309"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00056-6"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36576-1_13"},{"key":"ref21","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316823187","volume":"59","author":"jacobs","year":"2016","journal-title":"Introduction to coalgebra Towards mathematics of states and observations"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"359","DOI":"10.36045\/bbms\/1102714178","article-title":"Alternating tree automata, parity games, and modal ?-calculus","volume":"8","author":"wilke","year":"2001","journal-title":"Bull Belg Math Soc Simon Stevin"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2004.08.017"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535860"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.84.1"}],"event":{"name":"2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","location":"Vancouver, BC, Canada","start":{"date-parts":[[2019,6,24]]},"end":{"date-parts":[[2019,6,27]]}},"container-title":["2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8765678\/8785654\/08785691.pdf?arnumber=8785691","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,21]],"date-time":"2024-07-21T18:33:23Z","timestamp":1721586803000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8785691\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/lics.2019.8785691","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}