{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:47:23Z","timestamp":1740149243768,"version":"3.37.3"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100009024","name":"Exploratory Research for Advanced Technology","doi-asserted-by":"publisher","award":["JPMJER1603","JPMJER1603"],"award-info":[{"award-number":["JPMJER1603","JPMJER1603"]}],"id":[{"id":"10.13039\/501100009024","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009024","name":"Exploratory Research for Advanced Technology","doi-asserted-by":"publisher","award":["JPMJER1603","JPMJER1603"],"award-info":[{"award-number":["JPMJER1603","JPMJER1603"]}],"id":[{"id":"10.13039\/501100009024","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP21J13334","15KT0012"],"award-info":[{"award-number":["JP21J13334","15KT0012"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["15K11984"],"award-info":[{"award-number":["15K11984"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["683080"],"award-info":[{"award-number":["683080"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["New Gener. Comput."],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s00354-022-00186-y","type":"journal-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T19:07:46Z","timestamp":1659553666000},"page":"403-465","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Codensity Games for Bisimilarity"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3371-5243","authenticated-orcid":false,"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":"Samuel","family":"Humeau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clovis","family":"Eberhart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ichiro","family":"Hasuo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,3]]},"reference":[{"key":"186_CR1","doi-asserted-by":"crossref","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Proceedings of the 5th GI-Conference on Theoretical Computer Science, pp. 167\u2013183. Springer, London (1981). http:\/\/dl.acm.org\/citation.cfm?id=647210.720030","DOI":"10.1007\/BFb0017309"},{"key":"186_CR2","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Hoboken (1989)"},{"key":"186_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511792588","volume-title":"Advanced Topics in Bisimulation and Coinduction. Cambridge Tracts in Theoretical Computer Science","year":"2011","unstructured":"Sangiorgi, D., Rutten, J. (eds.): Advanced Topics in Bisimulation and Coinduction. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (2011). https:\/\/doi.org\/10.1017\/CBO9780511792588"},{"issue":"1","key":"186_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"KG Larsen","year":"1991","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inf. Comput. 94(1), 1\u201328 (1991)","journal-title":"Inf. Comput."},{"issue":"3","key":"186_CR5","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.tcs.2003.09.013","volume":"318","author":"J Desharnais","year":"2004","unstructured":"Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Metrics for labelled Markov processes. Theor. Comput. Sci. 318(3), 323\u2013354 (2004). https:\/\/doi.org\/10.1016\/j.tcs.2003.09.013","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"186_CR6","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1006\/inco.1998.2725","volume":"145","author":"C Hermida","year":"1998","unstructured":"Hermida, C., Jacobs, B.: Structural induction and coinduction in a fibrational setting. Inf. Comput. 145(2), 107\u2013152 (1998). https:\/\/doi.org\/10.1006\/inco.1998.2725","journal-title":"Inf. Comput."},{"issue":"4","key":"186_CR7","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1017\/S0960129517000056","volume":"28","author":"I Hasuo","year":"2018","unstructured":"Hasuo, I., Kataoka, T., Cho, K.: Coinductive predicates and final sequences in a fibration. Math. Struct. Comput. Sci. 28(4), 562\u2013611 (2018). https:\/\/doi.org\/10.1017\/S0960129517000056","journal-title":"Math. Struct. Comput. Sci."},{"key":"186_CR8","doi-asserted-by":"publisher","DOI":"10.23638\/LMCS-14(3:20)2018","author":"P Baldan","year":"2018","unstructured":"Baldan, P., Bonchi, F., Kerstan, H., K\u00f6nig, B.: Coalgebraic behavioral metrics. Log. Methods Comput. Sci. (2018). https:\/\/doi.org\/10.23638\/LMCS-14(3:20)2018","journal-title":"Log. Methods Comput. Sci."},{"key":"186_CR9","doi-asserted-by":"publisher","unstructured":"Bonchi, F., Petrisan, D., Pous, D., Rot, J.: Coinduction up-to in a fibrational setting. In: Henzinger, T.A., Miller, D. (eds.) Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS \u201914, Vienna, Austria, July 14 - 18, 2014, pp. 20\u20131209. ACM (2014). https:\/\/doi.org\/10.1145\/2603088.2603149","DOI":"10.1145\/2603088.2603149"},{"key":"186_CR10","unstructured":"K\u00f6nig, B., Mika-Michalski, C.: (Metric) bisimulation games and real-valued modal logics for coalgebras. In: 29th International Conference on Concurrency Theory, CONCUR 2018, September 4-7, 2018, pp. 37\u201313717. Beijing, China (2018)"},{"key":"186_CR11","doi-asserted-by":"publisher","unstructured":"Bonchi, F., K\u00f6nig, B., Petrisan, D.: Up-to techniques for behavioural metrics via fibrations. In: Schewe, S., Zhang, L. (eds.) 29th International Conference on Concurrency Theory, CONCUR 2018, September 4-7, 2018, Beijing, China. LIPIcs, vol. 118, pp. 17\u201311717. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2018.17","DOI":"10.4230\/LIPIcs.CONCUR.2018.17"},{"key":"186_CR12","doi-asserted-by":"crossref","unstructured":"Wi\u00dfmann, T., Dubut, J., Katsumata, S., Hasuo, I.: Path category for free\u2014open morphisms from coalgebras with non-deterministic branching. CoRR (2018). arXiv:1811.12294 (To appear in Proc. FoSSaCS 2019)","DOI":"10.1007\/978-3-030-17127-8_30"},{"key":"186_CR13","unstructured":"Fijalkow, N., Klin, B., Panangaden, P.: Expressiveness of probabilistic modal logics, Revisited. In: Procs. ICALP 2017. Leibniz International Proceedings in Informatics (LIPIcs), vol. 80, pp. 105\u2013110512 (2017)"},{"key":"186_CR14","doi-asserted-by":"publisher","DOI":"10.23638\/LMCS-14(4:6)2018","author":"S Katsumata","year":"2018","unstructured":"Katsumata, S., Sato, T., Uustalu, T.: Codensity lifting of monads and its dual. Log. Methods Comput. Sci. (2018). https:\/\/doi.org\/10.23638\/LMCS-14(4:6)2018","journal-title":"Log. Methods Comput. Sci."},{"key":"186_CR15","doi-asserted-by":"publisher","unstructured":"Sprunger, D., Katsumata, S., Dubut, J., Hasuo, I.: Fibrational bisimulations and quantitative reasoning. In: C\u00eerstea, C. (ed.) Coalgebraic Methods in Computer Science: 14th IFIP WG 1.3 International Workshop, CMCS 2018, Colocated with ETAPS 2018, Thessaloniki, Greece, April 14-15, 2018, Revised Selected Papers. Lecture Notes in Computer Science, vol. 11202, pp. 190\u2013213. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-030-00389-0_11","DOI":"10.1007\/978-3-030-00389-0_11"},{"key":"186_CR16","doi-asserted-by":"publisher","unstructured":"Desharnais, J., Laviolette, F., Tracol, M.: Approximate analysis of probabilistic processes: Logic, simulation and games. In: 2008 Fifth International Conference on Quantitative Evaluation of Systems, pp. 264\u2013273 (2008). https:\/\/doi.org\/10.1109\/QEST.2008.42","DOI":"10.1109\/QEST.2008.42"},{"key":"186_CR17","doi-asserted-by":"publisher","unstructured":"Komorida, Y., Katsumata, S., Hu, N., Klin, B., Hasuo, I.: Codensity games for bisimilarity. In: 34th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24-27, 2019, pp. 1\u201313. IEEE (2019). https:\/\/doi.org\/10.1109\/LICS.2019.8785691","DOI":"10.1109\/LICS.2019.8785691"},{"key":"186_CR18","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-7(1:13)2011","author":"S Staton","year":"2011","unstructured":"Staton, S.: Relating coalgebraic notions of bisimulation. Log. Methods Comput. Sci. (2011). https:\/\/doi.org\/10.2168\/LMCS-7(1:13)2011","journal-title":"Log. Methods Comput. Sci."},{"key":"186_CR19","doi-asserted-by":"publisher","unstructured":"Bakhtiari, Z., Hansen, H.H.: Bisimulation for weakly expressive coalgebraic modal logics. In: Bonchi, F., K\u00f6nig, B. (eds.) 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol. 72, pp. 4\u20131416. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2017). https:\/\/doi.org\/10.4230\/LIPIcs.CALCO.2017.4. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2017\/8050","DOI":"10.4230\/LIPIcs.CALCO.2017.4"},{"key":"186_CR20","doi-asserted-by":"publisher","unstructured":"Balle, B., Gourdeau, P., Panangaden, P.: Bisimulation Metrics for Weighted Automata. In: Chatzigiannakis, I., Indyk, P., Kuhn, F., Muscholl, A. (eds.) 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol. 80, pp. 103\u2013110314. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2017.103. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2017\/7395","DOI":"10.4230\/LIPIcs.ICALP.2017.103"},{"key":"186_CR21","doi-asserted-by":"publisher","unstructured":"Komorida, Y., Katsumata, S.-y., Kupke, C., Rot, J., Hasuo, I.: Expressivity of quantitative modal logics : Categorical foundations via codensity and approximation. In: 2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), pp. 1\u201314 (2021). https:\/\/doi.org\/10.1109\/LICS52264.2021.9470656","DOI":"10.1109\/LICS52264.2021.9470656"},{"issue":"2","key":"186_CR22","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1006\/inco.1996.0057","volume":"127","author":"A Joyal","year":"1996","unstructured":"Joyal, A., Nielsen, M., Winskel, G.: Bisimulation from open maps. Inf. Comput. 127(2), 164\u2013185 (1996)","journal-title":"Inf. Comput."},{"key":"186_CR23","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, 3\u201380 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"186_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316823187","volume-title":"Introduction to Coalgebra: Towards Mathematics of States and Observation. Cambridge Tracts in Theoretical Computer Science","author":"B Jacobs","year":"2016","unstructured":"Jacobs, B.: Introduction to Coalgebra: Towards Mathematics of States and Observation. Cambridge Tracts in Theoretical Computer Science, vol. 59. Cambridge University Press, Cambridge (2016). https:\/\/doi.org\/10.1017\/CBO9781316823187"},{"key":"186_CR25","doi-asserted-by":"publisher","unstructured":"van Breugel, F., Mislove, M.W., Ouaknine, J., Worrell, J.: An intrinsic characterization of approximate probabilistic bisimilarity. In: Gordon, A.D. (ed.) Foundations of Software Science and Computational Structures, 6th International Conference, FOSSACS 2003 Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2003, Warsaw, Poland, April 7-11, 2003, Proceedings. Lecture Notes in Computer Science, vol. 2620, pp. 200\u2013215. Springer (2003). https:\/\/doi.org\/10.1007\/3-540-36576-1_13","DOI":"10.1007\/3-540-36576-1_13"},{"key":"186_CR26","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.entcs.2004.08.017","volume":"100","author":"PJL Cuijpers","year":"2004","unstructured":"Cuijpers, P.J.L., Reniers, M.A.: Topological (bi-)simulation. Electr. Notes Theor. Comput. Sci. 100, 49\u201364 (2004). https:\/\/doi.org\/10.1016\/j.entcs.2004.08.017","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"186_CR27","doi-asserted-by":"publisher","DOI":"10.1145\/3290339","author":"P Baldan","year":"2019","unstructured":"Baldan, P., K\u00f6nig, B., Mika-Michalski, C., Padoan, T.: Fixpoint games on continuous lattices. Proc. ACM Program. Lang. (2019). https:\/\/doi.org\/10.1145\/3290339","journal-title":"Proc. ACM Program. Lang."},{"issue":"2","key":"186_CR28","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pac. J. Math. 5(2), 285\u2013309 (1955)","journal-title":"Pac. J. Math."},{"issue":"1","key":"186_CR29","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."},{"issue":"2","key":"186_CR30","doi-asserted-by":"publisher","first-page":"359","DOI":"10.36045\/bbms\/1102714178","volume":"8","author":"T Wilke","year":"2001","unstructured":"Wilke, T.: Alternating tree automata, parity games, and modal $$\\mu$$-calculus. Bull. Belg. Math. Soc. Simon Stevin 8(2), 359\u2013391 (2001)","journal-title":"Bull. Belg. Math. Soc. Simon Stevin"},{"key":"186_CR31","doi-asserted-by":"publisher","unstructured":"Ehlers, R., Moldovan, D.: Sparse positional strategies for safety games. In: Peled, D.A., Schewe, S. (eds.) Proceedings First Workshop on Synthesis, SYNT 2012, Berkeley, California, USA, 7th and 8th July 2012. EPTCS, vol. 84, pp. 1\u201316 (2012). https:\/\/doi.org\/10.4204\/EPTCS.84.1","DOI":"10.4204\/EPTCS.84.1"},{"key":"186_CR32","doi-asserted-by":"publisher","unstructured":"Beyene, T.A., Chaudhuri, S., Popeea, C., Rybalchenko, A.: A constraint-based approach to solving games on infinite graphs. In: Jagannathan, S., Sewell, P. (eds.) The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL \u201914, San Diego, CA, USA, January 20-21, 2014, pp. 221\u2013234. ACM (2014). https:\/\/doi.org\/10.1145\/2535838.2535860","DOI":"10.1145\/2535838.2535860"},{"key":"186_CR33","volume-title":"Categorical Logic and Type Theory","author":"B Jacobs","year":"1999","unstructured":"Jacobs, B.: Categorical Logic and Type Theory. North Holland, Amsterdam (1999)"},{"issue":"2","key":"186_CR34","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0016-660X(74)90016-6","volume":"4","author":"H Herrlich","year":"1974","unstructured":"Herrlich, H.: Topological functors. Gen. Topol. Appl. 4(2), 125\u2013142 (1974). https:\/\/doi.org\/10.1016\/0016-660X(74)90016-6","journal-title":"Gen. Topol. Appl."},{"key":"186_CR35","volume-title":"Abstract and Concrete Categories","author":"J Ad\u00e1mek","year":"1990","unstructured":"Ad\u00e1mek, J., Herrlich, H., Strecker, G.: Abstract and Concrete Categories. Wiley-Interscience, New York (1990)"},{"key":"186_CR36","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2009.01.002","volume":"222","author":"R Tix","year":"2009","unstructured":"Tix, R., Keimel, K., Plotkin, G.: Semantic domains for combining probability and non-determinism. Electron. Notes Theor. Comput. Sci. 222, 3\u201399 (2009). https:\/\/doi.org\/10.1016\/j.entcs.2009.01.002","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"186_CR37","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2015.03.047","volume":"604","author":"I Hasuo","year":"2015","unstructured":"Hasuo, I.: Generic weakest precondition semantics from monads enriched with order. Theor. Comput. Sci. 604, 2\u201329 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.03.047","journal-title":"Theor. Comput. Sci."},{"key":"186_CR38","doi-asserted-by":"crossref","unstructured":"Hino, W., Kobayashi, H., Hasuo, I., Jacobs, B.: Healthiness from duality. In: Grohe, M., Koskinen, E., Shankar, N. (eds.) Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS \u201916, New York, NY, USA, July 5-8, 2016, pp. 682\u2013691. ACM (2016)","DOI":"10.1145\/2933575.2935319"},{"key":"186_CR39","volume-title":"Categories for the Working Mathematician. Graduate Texts in Mathematics","author":"S MacLane","year":"1998","unstructured":"MacLane, S.: Categories for the Working Mathematician. Graduate Texts in Mathematics, vol. 5, 2nd edn. Springer, Berlin (1998)","edition":"2"},{"key":"186_CR40","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107050884","volume-title":"Modal Logic. Cambridge Tracts in Theoretical Computer Science","author":"P Blackburn","year":"2001","unstructured":"Blackburn, P., Rijke, M.D., Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (2001). https:\/\/doi.org\/10.1017\/CBO9781107050884"},{"key":"186_CR41","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to Lattices and Order","author":"BA Davey","year":"2002","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002). https:\/\/doi.org\/10.1017\/CBO9780511809088","edition":"2"},{"key":"186_CR42","volume-title":"Topology Via Logic Tracts in Theoretical Computer Science","author":"S Vickers","year":"1989","unstructured":"Vickers, S.: Topology Via Logic Tracts in Theoretical Computer Science, vol. 5. Cambridge University Press, Cambridge (1989)"},{"issue":"2\u20133","key":"186_CR43","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":"186_CR44","doi-asserted-by":"publisher","unstructured":"Klin, B.: The least fibred lifting and the expressivity of coalgebraic modal logic. In: Fiadeiro, J.L., Harman, N., Roggenbach, M., Rutten, J.J.M.M. (eds.) Algebra and Coalgebra in Computer Science: First International Conference, CALCO 2005, Swansea, UK, September 3-6, 2005, Proceedings. Lecture Notes in Computer Science, vol. 3629, pp. 247\u2013262. Springer (2005). https:\/\/doi.org\/10.1007\/11548133_16","DOI":"10.1007\/11548133_16"},{"issue":"5","key":"186_CR45","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1093\/logcom\/exn090","volume":"20","author":"J Ad\u00e1mek","year":"2010","unstructured":"Ad\u00e1mek, J., Gumm, H.P., Trnkov\u00e1, V.: Presentation of set functors: a coalgebraic perspective. J. Log. Comput. 20(5), 991\u20131015 (2010). https:\/\/doi.org\/10.1093\/logcom\/exn090","journal-title":"J. Log. Comput."},{"issue":"1","key":"186_CR46","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."},{"key":"186_CR47","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-04081-8_12","volume-title":"CONCUR 2009-Concurrency Theory","author":"M Boreale","year":"2009","unstructured":"Boreale, M.: Weighted bisimulation in linear algebraic form. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009-Concurrency Theory, pp. 163\u2013177. Springer, Berlin (2009)"},{"key":"186_CR48","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4383-8","volume-title":"A Course in Functional Analysis. Graduate Texts in Mathematics","author":"JB Conway","year":"2007","unstructured":"Conway, J.B.: A Course in Functional Analysis. Graduate Texts in Mathematics, vol. 96, 2nd edn. Springer, Berlin (2007)","edition":"2"},{"issue":"5","key":"186_CR49","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1137\/S0097539703420675","volume":"34","author":"K Etessami","year":"2005","unstructured":"Etessami, K., Wilke, T., Schuller, R.A.: Fair simulation relations, parity games, and state space reduction for B\u00fcchi automata. SIAM J. Comput. 34(5), 1159\u20131175 (2005)","journal-title":"SIAM J. Comput."}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-022-00186-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00354-022-00186-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-022-00186-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,6]],"date-time":"2022-09-06T19:44:16Z","timestamp":1662493456000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00354-022-00186-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["186"],"URL":"https:\/\/doi.org\/10.1007\/s00354-022-00186-y","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"type":"print","value":"0288-3635"},{"type":"electronic","value":"1882-7055"}],"subject":[],"published":{"date-parts":[[2022,7]]},"assertion":[{"value":"16 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}