{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:13:37Z","timestamp":1760080417038,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030572006"},{"type":"electronic","value":"9783030572013"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-57201-3_8","type":"book-chapter","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T23:20:00Z","timestamp":1597965600000},"page":"133-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Explaining Non-bisimilarity in a Coalgebraic Approach: Games and Distinguishing Formulas"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4193-2889","authenticated-orcid":false,"given":"Barbara","family":"K\u00f6nig","sequence":"first","affiliation":[]},{"given":"Christina","family":"Mika-Michalski","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3146-5906","authenticated-orcid":false,"given":"Lutz","family":"Schr\u00f6der","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,21]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-22944-2_7","volume-title":"Algebra and Coalgebra in Computer Science","author":"A Balan","year":"2011","unstructured":"Balan, A., Kurz, A.: Finitary functors: from Set to Preord and Poset. In: Corradini, A., Klin, B., C\u00eerstea, C. (eds.) CALCO 2011. LNCS, vol. 6859, pp. 85\u201399. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22944-2_7"},{"key":"8_CR2","unstructured":"Baltag, A.: Truth-as-simulation: towards a coalgebraic perspective on logic and games. Technical report SEN-R9923, CWI, November 1999"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Baltag, A.: A logic for coalgebraic simulation. In: Coalgebraic Methods in Computer Science, CMCS 2000. ENTCS, vol. 33, pp. 42\u201360. Elsevier (2000)","DOI":"10.1016\/S1571-0661(05)80343-3"},{"key":"8_CR4","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BFb0060439","volume-title":"Reports of the Midwest Category Seminar IV","author":"M Barr","year":"1970","unstructured":"Barr, M.: Relational algebras. In: MacLane, S., et al. (eds.) Reports of the Midwest Category Seminar IV. Lecture Notes in Mathematics, vol. 137, pp. 39\u201355. Springer, Heidelberg (1970). https:\/\/doi.org\/10.1007\/BFb0060439"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-662-44584-6_4","volume-title":"CONCUR 2014 \u2013 Concurrency Theory","author":"K Chatzikokolakis","year":"2014","unstructured":"Chatzikokolakis, K., Gebler, D., Palamidessi, C., Xu, L.: Generalized bisimulation metrics. In: Baldan, P., Gorla, D. (eds.) CONCUR 2014. LNCS, vol. 8704, pp. 32\u201346. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44584-6_4"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/BFb0023750","volume-title":"Computer-Aided Verification","author":"R Cleveland","year":"1991","unstructured":"Cleveland, R.: On automatically explaining bisimulation inequivalence. In: Clarke, E.M., Kurshan, R.P. (eds.) CAV 1990. LNCS, vol. 531, pp. 364\u2013372. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0023750"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-030-30942-8_18","volume-title":"Formal Methods \u2013 The Next 30 Years","author":"H-P Deifel","year":"2019","unstructured":"Deifel, H.-P., Milius, S., Schr\u00f6der, L., Wi\u00dfmann, T.: Generic partition refinement and weighted tree automata. In: ter Beek, M.H., McIver, A., Oliveira, J.N. (eds.) FM 2019. LNCS, vol. 11800, pp. 280\u2013297. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30942-8_18"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Desharnais, J., Laviolette, F., Tracol, M.: Approximate analysis of probabilistic processes: logic, simulation and games. In: Proceedings of QEST 2008, pp. 264\u2013273. IEEE (2008)","DOI":"10.1109\/QEST.2008.42"},{"key":"8_CR9","unstructured":"Dorsch, U., Milius, S., Schr\u00f6der, L., Wi\u00dfmann, T.: Efficient coalgebraic partition refinement. In: Proceedings of CONCUR 2017. LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"key":"8_CR10","unstructured":"de FrutosEscrig, D., Keiren, J.J.A., Willemse, T.A.C.: Games for bisimulations and abstraction (2016). https:\/\/arxiv.org\/abs\/1611.00401, arXiv:1611.00401"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-642-40206-7_19","volume-title":"Algebra and Coalgebra in Computer Science","author":"D Gor\u00edn","year":"2013","unstructured":"Gor\u00edn, D., Schr\u00f6der, L.: Simulations and bisimulations for coalgebraic modal logics. In: Heckel, R., Milius, S. (eds.) CALCO 2013. LNCS, vol. 8089, pp. 253\u2013266. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40206-7_19"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Hansen, H., Kupke, C.: A coalgebraic perspective on monotone modal logic. In: Coalgebraic Methods in Computer Science, CMCS 2004. LNCS, vol. 106, pp. 121\u2013143. Elsevier (2004)","DOI":"10.1016\/j.entcs.2004.02.028"},{"key":"8_CR13","unstructured":"Hansen, H.H.: Monotonic modal logics. Master\u2019s thesis, University of Amsterdam (2003)"},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, A.: Algebraic laws for nondeterminism and concurrency. J. ACM 32(1), 137\u2013161 (1985)","journal-title":"J. ACM"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"PC Kanellakis","year":"1990","unstructured":"Kanellakis, P.C., Smolka, S.A.: CCS expressions, finite state processes, and three problems of equivalence. Inf. Comput. 86, 43\u201368 (1990)","journal-title":"Inf. Comput."},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Komorida, Y., Katsumata, S.Y., Hu, N., Klin, B., Hasuo, I.: Codensity games for bisimilarity. In: Proceedings of LICS 2019, pp. 1\u201313. ACM (2019)","DOI":"10.1109\/LICS.2019.8785691"},{"issue":"4","key":"8_CR17","doi-asserted-by":"publisher","first-page":"1103","DOI":"10.1007\/s00500-016-2363-z","volume":"22","author":"B K\u00f6nig","year":"2018","unstructured":"K\u00f6nig, B., K\u00fcpper, S.: A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata. Soft Comput. 22(4), 1103\u20131120 (2018). https:\/\/doi.org\/10.1007\/s00500-016-2363-z","journal-title":"Soft Comput."},{"key":"8_CR18","unstructured":"K\u00f6nig, B., Mika-Michalski, C.: (Metric) Bisimulation games and real-valued modal logics for coalgebras. In: Proceedings of CONCUR 2018. LIPIcs, vol. 118, pp. 37:1\u201337:17. Schloss Dagstuhl - Leibniz Center for Informatics (2018)"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"K\u00f6nig, B., Mika-Michalski, C., Schr\u00f6der, L.: Explaining non-bisimilarity in a coalgebraic approach: games and distinguishing formulas (2020). https:\/\/arxiv.org\/abs\/2002.11459, arXiv:2002.11459","DOI":"10.1007\/978-3-030-57201-3_8"},{"issue":"1","key":"8_CR20","doi-asserted-by":"publisher","first-page":"99","DOI":"10.2307\/2586754","volume":"64","author":"M Kracht","year":"1999","unstructured":"Kracht, M., Wolter, F.: Normal monomodal logics can simulate all others. J. Symb. Log. 64(1), 99\u2013138 (1999)","journal-title":"J. Symb. Log."},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-00665-4_21","volume-title":"Logic, Language, and Computation","author":"C Kupke","year":"2009","unstructured":"Kupke, C.: Terminal sequence induction via games. In: Bosch, P., Gabelaia, D., Lang, J. (eds.) TbiLLC 2007. LNCS (LNAI), vol. 5422, pp. 257\u2013271. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00665-4_21"},{"issue":"6","key":"8_CR22","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"8_CR23","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(03)00201-9","volume":"309","author":"D Pattinson","year":"2003","unstructured":"Pattinson, D.: Coalgebraic modal logic: soundness, completeness and decidability of local consequence. Theoret. Comput. Sci. 309(1), 177\u2013193 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR24","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. Form. Log. 45, 19\u201333 (2004)","journal-title":"Notre Dame J. Form. Log."},{"issue":"1","key":"8_CR25","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J Rutten","year":"2000","unstructured":"Rutten, J.: Universal coalgebra: a theory of systems. Theoret. Comput. Sci. 249(1), 3\u201380 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"8_CR26","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. Theoret. Comput. Sci. 390(2), 230\u2013247 (2008)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"8_CR27","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1093\/jigpal\/7.1.103","volume":"7","author":"C Stirling","year":"1999","unstructured":"Stirling, C.: Bisimulation, modal logic and model checking games. Log. J. IGPL 7(1), 103\u2013124 (1999)","journal-title":"Log. J. IGPL"},{"key":"8_CR28","doi-asserted-by":"crossref","first-page":"189","DOI":"10.3233\/FI-1980-3208","volume":"3","author":"V Trnkov\u00e1","year":"1980","unstructured":"Trnkov\u00e1, V.: General theory of relational automata. Fundam. Inform. 3, 189\u2013234 (1980)","journal-title":"Fundam. Inform."},{"key":"8_CR29","unstructured":"Wi\u00dfmann, T.: Personal communication"},{"key":"8_CR30","unstructured":"Wi\u00dfmann, T.: Coalgebraic semantics and minimization in sets and beyond. Ph.D. thesis, Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (2020)"}],"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-030-57201-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,22]],"date-time":"2024-08-22T12:37:27Z","timestamp":1724330247000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57201-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030572006","9783030572013"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57201-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"21 August 2020","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":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cmcs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.coalg.org\/cmcs20\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"69% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2-3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"There were several online events in September and October of 2020.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}