{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:35:56Z","timestamp":1743014156799,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031617157"},{"type":"electronic","value":"9783031617164"}],"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-61716-4_13","type":"book-chapter","created":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T03:47:52Z","timestamp":1716954472000},"page":"203-213","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Relating Apartness and\u00a0Branching Bisimulation Games"],"prefix":"10.1007","author":[{"given":"Jurriaan","family":"Rot","sequence":"first","affiliation":[]},{"given":"Sebastian","family":"Junges","sequence":"additional","affiliation":[]},{"given":"Harsh","family":"Beohar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,22]]},"reference":[{"key":"13_CR1","unstructured":"de Frutos-Escrig, D., Keiren, J.J.A., Willemse, T.A.C.: Games for bisimulations and abstraction. Log. Methods Comput. Sci. 13(4) (2017)"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Ford, C., Milius, S., Schr\u00f6der, L., Beohar, H., K\u00f6nig, B.: Graded monads and behavioural equivalence games. In: LICS, pp. 61:1\u201361:13. ACM (2022)","DOI":"10.1145\/3531130.3533374"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","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. Lecture Notes in Computer Science, vol. 13560, pp. 266\u2013282. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15629-8_14"},{"key":"13_CR4","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":"13_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. J. ACM 32, 137\u2013161 (1985)","journal-title":"J. ACM"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Komorida, Y., Katsumata, S., Hu, N., Klin, B., Hasuo, I.: Codensity games for bisimilarity. In: LICS, pp. 1\u201313. IEEE (2019)","DOI":"10.1109\/LICS.2019.8785691"},{"key":"13_CR7","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"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D Park","year":"1981","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 167\u2013183. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/BFb0017309"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Stirling, C.: Modal and temporal logics for processes. LFCS ECS-LFCS-92-221, The University of Edinburgh (1992)","DOI":"10.1093\/oso\/9780198537618.003.0005"},{"issue":"1","key":"13_CR10","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":"13_CR11","unstructured":"Turkenburg, R., Beohar, H., Kupke, C., Rot, J.: Forward and backward steps in a fibration. In: CALCO. LIPIcs, vol. 270, pp. 6:1\u20136:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/3-540-57208-2_6","volume-title":"CONCUR 1993","author":"RJ Glabbeek","year":"1993","unstructured":"Glabbeek, R.J.: The linear time\u2014branching time spectrum II. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 66\u201381. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57208-2_6"},{"issue":"3","key":"13_CR13","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"RJ van Glabbeek","year":"1996","unstructured":"van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. J. ACM 43(3), 555\u2013600 (1996)","journal-title":"J. ACM"},{"key":"13_CR14","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"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-662-43951-7_31","volume-title":"Automata, Languages, and Programming","author":"Q Yin","year":"2014","unstructured":"Yin, Q., Fu, Y., He, C., Huang, M., Tao, X.: Branching bisimilarity checking for PRS. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 363\u2013374. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43951-7_31"}],"container-title":["Lecture Notes in Computer Science","Logics and Type Systems in Theory and Practice"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-61716-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T03:49:52Z","timestamp":1716954592000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-61716-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031617157","9783031617164"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-61716-4_13","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":"22 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}