{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:20:13Z","timestamp":1725549613878},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241270"},{"type":"electronic","value":"9783540304975"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30497-5_53","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:30:53Z","timestamp":1268400653000},"page":"336-345","source":"Crossref","is-referenced-by-count":0,"title":["Formalizing the Environment View of Process Equivalence"],"prefix":"10.1007","author":[{"given":"Yuxi","family":"Fu","sequence":"first","affiliation":[]},{"given":"Xiaoju","family":"Dong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"53_CR1","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(99)00231-5","volume":"240","author":"L. Cardelli","year":"2000","unstructured":"Cardelli, L., Gordon, A.: Mobile Ambient. Theoretical Computer Science\u00a0240, 177\u2013213 (2000)","journal-title":"Theoretical Computer Science"},{"key":"53_CR2","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 Communications. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256, pp. 325\u2013335. Springer, Heidelberg (1997)"},{"key":"53_CR3","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0304-3975(99)00037-7","volume":"221","author":"Y. Fu","year":"1999","unstructured":"Fu, Y.: Variations on Mobile Processes. Theoretical Computer Science\u00a0221, 327\u2013368 (1999)","journal-title":"Theoretical Computer Science"},{"key":"53_CR4","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. Information and Computation\u00a0184, 201\u2013226 (2003)","journal-title":"Information and Computation"},{"key":"53_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/3-540-44618-4_42","volume-title":"CONCUR 2000 - Concurrency Theory","author":"Y. Fu","year":"2000","unstructured":"Fu, Y., Yang, Z.: Chi Calculus with Mismatch. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 596\u2013610. Springer, Heidelberg (2000)"},{"key":"53_CR6","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1016\/S0304-3975(02)00373-0","volume":"290","author":"Y. Fu","year":"2002","unstructured":"Fu, Y., Yang, Z.: Understanding the Mismatch Combinator in Chi Calculus. Theoretical Computer Science\u00a0290, 779\u2013830 (2002)","journal-title":"Theoretical Computer Science"},{"key":"53_CR7","doi-asserted-by":"crossref","unstructured":"Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes. Information and Computation 100, 1\u201340 (Part I), 41\u201377 (Part II) (1992)","DOI":"10.1016\/0890-5401(92)90009-5"},{"key":"53_CR8","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":"53_CR9","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s002360050036","volume":"3","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: A Theory of Bisimulation for \u03c0-Calculus. Acta Informatica\u00a03, 69\u201397 (1996)","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Computational and Information Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30497-5_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:56:00Z","timestamp":1605761760000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30497-5_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241270","9783540304975"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30497-5_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}