{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:47Z","timestamp":1740099047029,"version":"3.37.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319893655"},{"type":"electronic","value":"9783319893662"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89366-2_12","type":"book-chapter","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T23:52:34Z","timestamp":1523663554000},"page":"221-237","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Logics for Bisimulation and Divergence"],"prefix":"10.1007","author":[{"given":"Xinxin","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5645-0874","authenticated-orcid":false,"given":"Tingting","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenhui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,14]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BFb0022510","volume-title":"Mathematical Foundations of Computer Science 1980","author":"MCB Hennessy","year":"1980","unstructured":"Hennessy, M.C.B., Plotkin, G.D.: A term model for CCS. In: Dembi\u0144ski, P. (ed.) MFCS 1980. LNCS, vol. 88, pp. 261\u2013274. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/BFb0022510"},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/2455.2460","volume":"32","author":"M Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for non-determinism and concurrency. J. ACM 32(1), 131\u2013161 (1985)","journal-title":"J. ACM"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/0890-5401(90)90048-M","volume":"85","author":"DJ Walker","year":"1990","unstructured":"Walker, D.J.: Bisimulation and divergence. Inf. Comput. 85, 212\u2013241 (1990)","journal-title":"Inf. Comput."},{"key":"12_CR4","volume-title":"Modal Logic and Classical Logic","author":"J Benthem van","year":"1983","unstructured":"van Benthem, J.: Modal Logic and Classical Logic. Bibliopolis, Naples (1983)"},{"key":"12_CR5","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":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1145\/201019.201032","volume":"42","author":"R Nicola de","year":"1995","unstructured":"de Nicola, R., Vaandrager, F.: Three logics for branching bisimulation. J. ACM 42(2), 458\u2013487 (1995)","journal-title":"J. ACM"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"P Kannelakis","year":"1990","unstructured":"Kannelakis, P., Smolka, S.: CCS expressions, finite state processes and three problems of equivalence. Inf. Comput. 86, 43\u201368 (1990)","journal-title":"Inf. Comput."},{"key":"12_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":"12_CR9","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Upper Saddle River (1989)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Liu, X., Yu, T., Zhang, W.: Analyzing divergence in bisimulation semantics. In: Proceedings of POPL (2017)","DOI":"10.1145\/3009837.3009870"},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0020-0190(96)00034-8","volume":"58","author":"T Basten","year":"1996","unstructured":"Basten, T.: Branching bisimularity is an equivalence indeed!. Inf. Process. Lett. 58(3), 141\u2013147 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"12_CR12","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"RJ Glabbeek van","year":"1996","unstructured":"van Glabbeek, R.J., Weijland, P.: Branching time and abstraction in bisimulation semantics. J. ACM 43(3), 555\u2013600 (1996)","journal-title":"J. ACM"},{"issue":"4","key":"12_CR13","doi-asserted-by":"crossref","first-page":"371","DOI":"10.3233\/FI-2009-109","volume":"93","author":"RJ Glabbeek van","year":"2009","unstructured":"van Glabbeek, R.J., Luttik, B., Trcka, N.: Branching bisimilarity with explicit divergence. Fundam. Inf. 93(4), 371\u2013392 (2009)","journal-title":"Fundam. Inf."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R.J., Luttik, B., Trcka, N.: Computation tree logic with deadlock detection. Log. Methods Comput. Sci. 5(4) (2009)","DOI":"10.2168\/LMCS-5(4:5)2009"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/BFb0032063","volume-title":"Automata, Languages and Programming","author":"JF Groote","year":"1990","unstructured":"Groote, J.F., Vaandrager, F.: An efficient algorithm for branching bisimulation and stuttering equivalence. In: Paterson, M.S. (ed.) ICALP 1990. LNCS, vol. 443, pp. 626\u2013638. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0032063"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89366-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,31]],"date-time":"2020-10-31T19:23:07Z","timestamp":1604172187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-89366-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319893655","9783319893662"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89366-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}