{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:00:14Z","timestamp":1742940014704,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"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_8","type":"book-chapter","created":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T07:03:08Z","timestamp":1721890988000},"page":"156-173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Proving Behavioural Apartness"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7336-9405","authenticated-orcid":false,"given":"Ruben","family":"Turkenburg","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5256-1334","authenticated-orcid":false,"given":"Harsh","family":"Beohar","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0502-391X","authenticated-orcid":false,"given":"Clemens","family":"Kupke","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1404-6232","authenticated-orcid":false,"given":"Jurriaan","family":"Rot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,26]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BFb0018361","volume-title":"Category Theory and Computer Science","author":"P Aczel","year":"1989","unstructured":"Aczel, P., Mendler, N.: A final coalgebra theorem. In: Pitt, D.H., Rydeheard, D.E., Dybjer, P., Pitts, A.M., Poign\u00e9, A. (eds.) Category Theory and Computer Science. LNCS, vol. 389, pp. 357\u2013365. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0018361"},{"key":"8_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"},{"key":"8_CR3","unstructured":"Basold, H.: Mixed inductive-coinductive reasoning types, programs and logic. Ph.D. thesis, Radboud Universiteit Nijmegen (2018)"},{"key":"8_CR4","unstructured":"Beohar, H., Gurke, S., K\u00f6nig, B., Messing, K.: Hennessy-Milner theorems via Galois connections. In: CSL. LIPIcs, vol.\u00a0252, pp. 12:1\u201312:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"8_CR5","unstructured":"Beohar, H., et al.: Expressive quantale-valued logics for coalgebras: an adjunction-based approach. In: STACS. LIPIcs, vol.\u00a0289, pp. 10:1\u201310:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"key":"8_CR6","unstructured":"Blok, A.: Interaction, observation and denotation. Master\u2019s thesis, Universiteit van Amsterdam (2012)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-662-46678-0_26","volume-title":"Foundations of Software Science and Computation Structures","author":"R Clouston","year":"2015","unstructured":"Clouston, R., Bizjak, A., Grathwohl, H.B., Birkedal, L.: Programming and reasoning with guarded recursion for coinductive types. In: Pitts, A. (ed.) FoSSaCS 2015. LNCS, vol. 9034, pp. 407\u2013421. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46678-0_26"},{"issue":"2","key":"8_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1006\/inco.2001.2962","volume":"179","author":"J Desharnais","year":"2002","unstructured":"Desharnais, J., Edalat, A., Panangaden, P.: Bisimulation for labelled Markov processes. Inf. Comput. 179(2), 163\u2013193 (2002)","journal-title":"Inf. Comput."},{"key":"8_CR9","unstructured":"Fijalkow, N., Klin, B., Panangaden, P.: Expressiveness of probabilistic modal logics, revisited. In: ICALP. LIPIcs, vol.\u00a080, pp. 105:1\u2013105:12. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"8_CR10","unstructured":"Forster, J., Goncharov, S., Hofmann, D., Nora, P., Schr\u00f6der, L., Wild, P.: Quantitative Hennessy-Milner theorems via notions of density. In: CSL. LIPIcs, vol.\u00a0252, pp. 22:1\u201322:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"8_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-031-15629-8_14","volume-title":"A Journey from Process Algebra via Timed Automata to Model Learning","author":"H Geuvers","year":"2022","unstructured":"Geuvers, H.: Apartness and distinguishing formulas in Hennessy-Milner logic. In: Jansen, N., Stoelinga, M., van den Bos, P. (eds.) A Journey from Process Algebra via Timed Automata to Model Learning. LNCS, vol. 13560, pp. 266\u2013282. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15629-8_14"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Geuvers, H., Jacobs, B.: Relating apartness and bisimulation. Log. Methods Comput. Sci. 17(3) (2021)","DOI":"10.46298\/lmcs-17(3:15)2021"},{"key":"8_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-031-30829-1_3","volume-title":"FoSSaCS 2023","author":"S Goncharov","year":"2023","unstructured":"Goncharov, S., Hofmann, D., Nora, P., Schr\u00f6der, L., Wild, P.: Kantorovich functors and characteristic logics for behavioural distances. In: Kupferman, O., Sobocinski, P. (eds.) FoSSaCS 2023. LNCS, vol. 13992, pp. 46\u201367. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30829-1_3"},{"key":"8_CR14","unstructured":"Gumm, H.P.: Elements of the general theory of coalgebras. In: LUATCS 99. Rand Afrikaans University, South Africa (1999)"},{"issue":"12\u201313","key":"8_CR15","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1016\/j.tcs.2008.09.057","volume":"410","author":"HP Gumm","year":"2009","unstructured":"Gumm, H.P.: Copower functors. Theor. Comput. Sci. 410(12\u201313), 1129\u20131142 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Gumm, H.P., Schr\u00f6der, T.: Monoid-labeled transition systems. In: CMCS. Electronic Notes in Theoretical Computer Science, vol.\u00a044, pp. 185\u2013204. Elsevier (2001)","DOI":"10.1016\/S1571-0661(04)80908-3"},{"issue":"4","key":"8_CR17","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)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"2","key":"8_CR18","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)","journal-title":"Inf. Comput."},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Jacobs, B.: Introduction to Coalgebra: Towards Mathematics of States and Observation, Cambridge Tracts in Theoretical Computer Science, vol.\u00a059. Cambridge University Press, Cambridge (2016)","DOI":"10.1017\/CBO9781316823187"},{"key":"8_CR20","unstructured":"Katsumata, S., Sato, T., Uustalu, T.: Codensity lifting of monads and its dual. Log. Methods Comput. Sci. 14(4) (2018)"},{"issue":"2","key":"8_CR21","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s00354-022-00186-y","volume":"40","author":"Y Komorida","year":"2022","unstructured":"Komorida, Y., et al.: Codensity games for bisimilarity. New Gener. Comput. 40(2), 403\u2013465 (2022)","journal-title":"New Gener. Comput."},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Komorida, Y., Katsumata, S., Kupke, C., Rot, J., Hasuo, I.: Expressivity of quantitative modal logics: categorical foundations via codensity and approximation. In: LICS, pp. 1\u201314. IEEE (2021)","DOI":"10.1109\/LICS52264.2021.9470656"},{"key":"8_CR23","unstructured":"K\u00f6nig, B., Mika-Michalski, C.: (Metric) bisimulation games and real-valued modal logics for coalgebras. In: CONCUR. LIPIcs, vol.\u00a0118, pp. 37:1\u201337:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-030-57201-3_8","volume-title":"Coalgebraic Methods in Computer Science","author":"B K\u00f6nig","year":"2020","unstructured":"K\u00f6nig, B., Mika-Michalski, C., Schr\u00f6der, L.: Explaining non-bisimilarity in a coalgebraic approach: games and distinguishing formulas. In: Petri\u015fan, D., Rot, J. (eds.) CMCS 2020. LNCS, vol. 12094, pp. 133\u2013154. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57201-3_8"},{"issue":"1","key":"8_CR25","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."},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-642-03741-2_30","volume-title":"Algebra and Coalgebra in Computer Science","author":"D Lucanu","year":"2009","unstructured":"Lucanu, D., Goriac, E.-I., Caltais, G., Ro\u015fu, G.: CIRC: a behavioral verification tool based on circular coinduction. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol. 5728, pp. 433\u2013442. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03741-2_30"},{"issue":"1\u20133","key":"8_CR27","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0168-0072(98)00042-6","volume":"96","author":"LS Moss","year":"1999","unstructured":"Moss, L.S.: Coalgebraic logic. Ann. Pure Appl. Log. 96(1\u20133), 277\u2013317 (1999)","journal-title":"Ann. Pure Appl. Log."},{"issue":"2\u20133","key":"8_CR28","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)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR29","unstructured":"Sokolova, A.: Coalgebraic analysis of probabilistic systems. Ph.D. thesis (2005)"},{"issue":"38","key":"8_CR30","doi-asserted-by":"publisher","first-page":"5095","DOI":"10.1016\/j.tcs.2011.05.008","volume":"412","author":"A Sokolova","year":"2011","unstructured":"Sokolova, A.: Probabilistic systems coalgebraically: a survey. Theor. Comput. Sci. 412(38), 5095\u20135110 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"8_CR31","doi-asserted-by":"publisher","first-page":"1526","DOI":"10.1093\/logcom\/exab051","volume":"31","author":"D Sprunger","year":"2021","unstructured":"Sprunger, D., Katsumata, S., Dubut, J., Hasuo, I.: Fibrational bisimulations and quantitative reasoning: extended version. J. Log. Comput. 31(6), 1526\u20131559 (2021)","journal-title":"J. Log. Comput."},{"key":"8_CR32","unstructured":"Sprunger, D., Moss, L.S.: Precongruences and parametrized coinduction for logics for behavioral equivalence. In: CALCO. LIPIcs, vol.\u00a072, pp. 23:1\u201323:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"8_CR33","doi-asserted-by":"crossref","unstructured":"Staton, S.: Relating coalgebraic notions of bisimulation. Log. Methods Comput. Sci. 7(1) (2011)","DOI":"10.2168\/LMCS-7(1:13)2011"},{"issue":"1\u20132","key":"8_CR34","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0304-3975(99)00035-3","volume":"221","author":"EP de Vink","year":"1999","unstructured":"de Vink, E.P., Rutten, J.J.M.M.: Bisimulation for probabilistic transition systems: a coalgebraic approach. Theor. Comput. Sci. 221(1\u20132), 271\u2013293 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR35","unstructured":"Wi\u00dfmann, T., Milius, S., Katsumata, S., Dubut, J.: A coalgebraic view on reachability (2020)"},{"key":"8_CR36","doi-asserted-by":"crossref","unstructured":"Wi\u00dfmann, T., Milius, S., Schr\u00f6der, L.: Quasilinear-time computation of generic modal witnesses for behavioural inequivalence. Log. Methods Comput. Sci. 18(4) (2022)","DOI":"10.46298\/lmcs-18(4:6)2022"},{"issue":"1\u20133","key":"8_CR37","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.tcs.2004.12.009","volume":"338","author":"J Worrell","year":"2005","unstructured":"Worrell, J.: On the final sequence of a finitary set functor. Theor. Comput. Sci. 338(1\u20133), 184\u2013199 (2005)","journal-title":"Theor. Comput. Sci."}],"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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T07:10:22Z","timestamp":1721891422000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-66438-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031664373","9783031664380"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-66438-0_8","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"}}]}}