{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:45:14Z","timestamp":1742921114141,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319395692"},{"type":"electronic","value":"9783319395708"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-39570-8_10","type":"book-chapter","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T05:04:10Z","timestamp":1464066250000},"page":"142-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Branching Bisimulation Games"],"prefix":"10.1007","author":[{"given":"David","family":"de Frutos Escrig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeroen J. A.","family":"Keiren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim A. C.","family":"Willemse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,24]]},"reference":[{"issue":"3","key":"10_CR1","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 bisimilarity is an equivalence indeed!. Inform. Process. Lett. 58(3), 141\u2013147 (1996)","journal-title":"Inform. Process. Lett."},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-44585-4_23","volume-title":"Computer Aided Verification","author":"S Blom","year":"2001","unstructured":"Blom, S., Fokkink, W.J., Groote, J.F., van Langevelde, I., Lisser, B., van de Pol, J.: mgrCRL: a toolset for analysing algebraic specifications. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 250\u2013254. Springer, Heidelberg (2001)"},{"key":"10_CR3","first-page":"59","volume":"12","author":"PE Bulychev","year":"2007","unstructured":"Bulychev, P.E., Konnov, I.V., Zakharov, V.A.: Computing (bi)simulation relations preserving CTL*-X for ordinary and fair Kripke structures. Inst. Syst. Program. Russ. Acad. Sci. Math. Meth. Algorithm 12, 59\u201376 (2007)","journal-title":"Inst. Syst. Program. Russ. Acad. Sci. Math. Meth. Algorithm"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-642-36742-7_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Cranen","year":"2013","unstructured":"Cranen, S., Groote, J.F., Keiren, J.J.A., Stappers, F.P.M., de Vink, E.P., Wesselink, W., Willemse, T.A.C.: An overview of the mCRL2 toolset and its recent advances. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013 (ETAPS 2013). LNCS, vol. 7795, pp. 199\u2013213. Springer, Heidelberg (2013)"},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10009-012-0244-z","volume":"15","author":"H Garavel","year":"2013","unstructured":"Garavel, H., Lang, F., Mateescu, R., Serwe, W.: CADP 2011: a toolbox for the construction and analysis of distributed processes. Int. J. Softw. Tools Technol. Transf. 15(2), 89\u2013107 (2013)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/inco.1998.2778","volume":"150","author":"R Gerth","year":"1999","unstructured":"Gerth, R., Kuiper, R., Peled, D., Penczek, W.: A partial order approach to branching time logic model checking. Inform. Comput. 150(2), 132\u2013152 (1999)","journal-title":"Inform. Comput."},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Automata Logics, and Infinite Games","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002)"},{"key":"10_CR8","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.W.: An efficient algorithm for branching and stuttering equivalence. In: Paterson, M.S. (ed.) Automata, Languages and Programming. LNCS, vol. 443, pp. 626\u2013638. Springer, Heidelberg (1990)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/978-3-662-49674-9_40","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"JF Groote","year":"2016","unstructured":"Groote, J.F., Wijs, A.: An O(m log n) algorithm for stuttering equivalence and branching bisimulation. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 607\u2013624. Springer, Heidelberg (2016). doi:\n                    10.1007\/978-3-662-49674-9_40"},{"key":"10_CR10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-10003-2_79","volume-title":"Automata, Languages and Programming","author":"M Hennessy","year":"1980","unstructured":"Hennessy, M., Milner, R.: On observing nondeterminism and concurrency. In: de Bakker, J., van Leeuwen, J. (eds.) Automata, Languages and Programming. LNCS, vol. 85, pp. 299\u2013309. Springer, Heidelberg (1980)"},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/3-540-55179-4_3","volume-title":"Computer Aided Verification","author":"Henri Korver","year":"1992","unstructured":"Korver, H.: Computing distinguishing formulas for branching bisimulation. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol. 575, pp. 13\u201323. Springer, Heidelberg (1992)"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/BFb0058037","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"KS Namjoshi","year":"1997","unstructured":"Namjoshi, K.S.: A simple characterization of stuttering bisimulation. In: Ramesh, S., Sivakumar, G. (eds.) FST TCS 1997. LNCS, vol. 1346, pp. 284\u2013296. Springer, Heidelberg (1997)"},{"key":"10_CR13","series-title":"LNCS","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.) Theoretical Computer Science. LNCS, vol. 104, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1093\/comjnl\/bxs156","volume":"57","author":"MA Reniers","year":"2014","unstructured":"Reniers, M.A., Schoren, R., Willemse, T.A.C.: Results on embeddings between state-based and event-based systems. Comput. J. 57(1), 73\u201392 (2014)","journal-title":"Comput. J."},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/BFb0054166","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"P Stevens","year":"1998","unstructured":"Stevens, P., Stirling, C.: Practical model-checking using games. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 85\u2013101. Springer, Heidelberg (1998)"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/3-540-60915-6_5","volume-title":"Logics for Concurrency","author":"C Stirling","year":"1996","unstructured":"Stirling, C.: Modal and temporal logics for processes. In: Moller, F., Birtwistle, G. (eds.) Structure versus Automata. LNCS, vol. 1043, pp. 149\u2013237. Springer, Heidelberg (1996)"},{"key":"10_CR17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/3-540-56610-4_89","volume-title":"TAPSOFT\u201993: Theory and Practice of Software Development","author":"W Thomas","year":"1993","unstructured":"Thomas, W.: On the Ehrenfeucht-Fra\u00efss\u00e9 game in theoretical computer science. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) TAPSOFT\u201993: Theory and Practice of Software Development. LNCS, vol. 668, pp. 559\u2013568. Springer, Heidelberg (1993)"},{"issue":"4","key":"10_CR18","doi-asserted-by":"crossref","first-page":"371","DOI":"10.3233\/FI-2009-109","volume":"93","author":"RJ van Glabbeek","year":"2009","unstructured":"van Glabbeek, R.J., Luttik, S.P., Tr\u00e7ka, N.: Branching bisimilarity with explicit divergence. Fundam. Inform. 93(4), 371\u2013392 (2009)","journal-title":"Fundam. Inform."},{"issue":"3","key":"10_CR19","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":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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, Part II. LNCS, vol. 8573, pp. 363\u2013374. Springer, Heidelberg (2014)"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39570-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,23]],"date-time":"2020-05-23T00:09:51Z","timestamp":1590192591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39570-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319395692","9783319395708"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39570-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"24 May 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}