{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:37:19Z","timestamp":1725550639457},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291077"},{"type":"electronic","value":"9783540320722"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11560647_21","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T14:04:06Z","timestamp":1129817046000},"page":"318-333","source":"Crossref","is-referenced-by-count":6,"title":["On Cool Congruence Formats for Weak Bisimulations"],"prefix":"10.1007","author":[{"given":"Rob Jan","family":"van Glabbeek","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1994.1040","volume":"111","author":"L. Aceto","year":"1994","unstructured":"Aceto, L., Bloom, B., Vaandrager, F.W.: Turning SOS rules into equations. Information and Computation\u00a0111(1), 1\u201352 (1994)","journal-title":"Information and Computation"},{"issue":"3","key":"21_CR2","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 bisimulation is an equivalence indeed! Information Processing Letters\u00a058(3), 141\u2013147 (1996)","journal-title":"Information Processing Letters"},{"issue":"1","key":"21_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J.A. Bergstra","year":"1985","unstructured":"Bergstra, J.A., Klop, J.W.: Algebra of communicating processes with abstraction. Theoretical Computer Science\u00a037(1), 77\u2013121 (1985)","journal-title":"Theoretical Computer Science"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0304-3975(94)00152-9","volume":"146","author":"B. Bloom","year":"1995","unstructured":"Bloom, B.: Structural operational semantics for weak bisimulations. Theoretical Computer Science\u00a0146, 25\u201368 (1995)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"21_CR5","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/200836.200876","volume":"42","author":"B. Bloom","year":"1995","unstructured":"Bloom, B., Istrail, S., Meyer, A.R.: Bisimulation can\u2019t be traced. Journal of the ACM\u00a042(1), 232\u2013268 (1995)","journal-title":"Journal of the ACM"},{"issue":"1","key":"21_CR6","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1006\/jcss.1999.1663","volume":"60","author":"W.J. Fokkink","year":"2000","unstructured":"Fokkink, W.J.: Rooted branching bisimulation as a congruence. Journal of Computer and System Sciences\u00a060(1), 13\u201337 (2000)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"21_CR7","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"R.J. Glabbeek van","year":"1996","unstructured":"van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. Journal of the ACM\u00a043(3), 555\u2013600 (1996)","journal-title":"Journal of the ACM"},{"key":"21_CR8","unstructured":"Milner, R.: Operational and algebraic semantics of concurrent processes. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch.\u00a019, pp. 1201\u20131242. Elsevier Science Publishers B.V, North-Holland (1990) Alternatively see Communication and Concurrency, Prentice-Hall International, Englewood Cliffs (1989), or A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1109\/LICS.1990.113741","volume-title":"Proceedings 5 th Annual Symposium on Logic in Computer Science","author":"F. Moller","year":"1990","unstructured":"Moller, F.: The nonexistence of finite axiomatisations for CCS congruences. In: Proceedings 5\n                    th\n                   Annual Symposium on Logic in Computer Science, Philadelphia, USA, pp. 142\u2013153. IEEE Computer Society Press, Los Alamitos (1990)"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jlap.2004.05.001","volume":"60","author":"G.D. Plotkin","year":"2004","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. The Journal of Logic and Algebraic Programming\u00a060\u201361, 17\u2013139 (2004) First appeared in 1981","journal-title":"The Journal of Logic and Algebraic Programming"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0304-3975(85)90093-3","volume":"37","author":"R. Simone de","year":"1985","unstructured":"de Simone, R.: Higher-level synchronising devices in Meije-SCCS. Theoretical Computer Science\u00a037, 245\u2013267 (1985)","journal-title":"Theoretical Computer Science"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1109\/LICS.1992.185529","volume-title":"Proceedings 7 th Annual Symposium on Logic in Computer Science","author":"I. Ulidowski","year":"1992","unstructured":"Ulidowski, I.: Equivalences on observable processes. In: Proceedings 7\n                    th\n                   Annual Symposium on Logic in Computer Science, Santa Cruz, California, pp. 148\u2013159. IEEE Computer Society Press, Los Alamitos (1992)"},{"key":"21_CR13","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/S0890-5401(02)93161-5","volume":"178","author":"I. Ulidowski","year":"2002","unstructured":"Ulidowski, I., Phillips, I.: Ordered SOS rules and process languages for branching and eager bisimulations. Information & Computation\u00a0178, 180\u2013213 (2002)","journal-title":"Information & Computation"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-44618-4_21","volume-title":"CONCUR 2000 - Concurrency Theory","author":"I. Ulidowski","year":"2000","unstructured":"Ulidowski, I., Yuen, S.: Process languages for rooted eager bisimulation. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 275\u2013289. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11560647_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T02:23:26Z","timestamp":1552443806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11560647_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291077","9783540320722"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11560647_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}