{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T07:40:11Z","timestamp":1736235611589,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540304951"},{"type":"electronic","value":"9783540324195"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11590156_10","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:43:16Z","timestamp":1133797396000},"page":"128-139","source":"Crossref","is-referenced-by-count":0,"title":["On the Bisimulation Congruence in \u03c7-Calculus"],"prefix":"10.1007","author":[{"given":"Taolue","family":"Chen","sequence":"first","affiliation":[]},{"given":"Tingting","family":"Han","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: POPL, pp. 104\u2013115 (2001)","DOI":"10.1145\/360204.360213"},{"key":"10_CR2","unstructured":"Chen, T.: Research on the Theory and Application of Mobile Process Calculi. Master\u2019s thesis, Nanjing University, Nanjing, P.R.China (2005)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Chen, T., Han, T., Lu, J.: On bisimulation congruence in \u03c7-calculus. Technical report, CWI, Amsterdam, The Netherlands (2005)","DOI":"10.1007\/11590156_10"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.jlap.2004.01.006","volume":"63","author":"C. Fournet","year":"2005","unstructured":"Fournet, C., Gonthier, G.: A hierarchy of equivalences for asynchronous calculi. J. Log. Algebr. Program.\u00a063, 131\u20131739 (2005)","journal-title":"J. Log. Algebr. Program."},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/3-540-63165-8_189","volume-title":"Automata, Languages and Programming","author":"Y. Fu","year":"1997","unstructured":"Fu, Y.: A proof theoretical approach to communication. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256, pp. 325\u2013335. Springer, Heidelberg (1997)"},{"issue":"1","key":"10_CR6","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0890-5401(03)00061-0","volume":"184","author":"Y. Fu","year":"2003","unstructured":"Fu, Y.: Bisimulation congruence of chi calculus. Inf. Comput.\u00a0184(1), 201\u2013226 (2003)","journal-title":"Inf. Comput."},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1016\/S0304-3975(02)00373-0","volume":"290","author":"Y. Fu","year":"2003","unstructured":"Fu, Y., Yang, Z.: Understanding the mismatch combinator in chi calculus. Theor. Comput. Sci.\u00a0290(1), 779\u2013830 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/3-540-44612-5_33","volume-title":"Mathematical Foundations of Computer Science 2000","author":"P. Gardner","year":"2000","unstructured":"Gardner, P., Wischik, L.: Explicit fusions. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 373\u2013382. Springer, Heidelberg (2000)"},{"issue":"2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0304-3975(95)00074-7","volume":"151","author":"K. Honda","year":"1995","unstructured":"Honda, K., Yoshida, N.: On reduction-based process semantics. Theor. Comput. Sci.\u00a0151(2), 437\u2013486 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR10","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile process, part I\/II. Inf. Comput.\u00a0100, 1\u201377 (1992)","journal-title":"Inf. Comput."},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1007\/3-540-55719-9_114","volume-title":"Automata, Languages and Programming","author":"R. Milner","year":"1992","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 685\u2013695. Springer, Heidelberg (1992)"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/BFb0000486","volume-title":"Algebraic Methodology and Software Technology","author":"J. Parrow","year":"1997","unstructured":"Parrow, J., Victor, B.: The update calculus (extended abstract). In: Johnson, M. (ed.) AMAST 1997. LNCS, vol.\u00a01349, pp. 409\u2013423. Springer, Heidelberg (1997)"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Parrow, J., Victor, B.: The fusion calculus: Expressiveness and symmetry in mobile processes. In: LICS, pp. 176\u2013185 (1998)","DOI":"10.1109\/LICS.1998.705654"},{"issue":"1","key":"10_CR15","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s002360050036","volume":"33","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: A theory of bisimulation for the \u03c0-calculus. Acta Inf.\u00a033(1), 69\u201397 (1996)","journal-title":"Acta Inf."},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/3-540-44685-0_20","volume-title":"CONCUR 2001 - Concurrency Theory","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: On barbed equivalences in pi-calculus. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 292\u2013304. Springer, Heidelberg (2001)"},{"key":"10_CR17","volume-title":"The \u03c0-calculus: a Theory of Mobile Processes","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-540-24727-2_34","volume-title":"Foundations of Software Science and Computation Structures","author":"L. Wischik","year":"2004","unstructured":"Wischik, L., Gardner, P.: Strong bisimulation for the explicit fusion calculus. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 484\u2013498. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11590156_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T05:12:02Z","timestamp":1736140322000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11590156_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304951","9783540324195"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11590156_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}