{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T04:56:31Z","timestamp":1763182591787},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540237242"},{"type":"electronic","value":"9783540304777"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30477-7_12","type":"book-chapter","created":{"date-parts":[[2010,2,28]],"date-time":"2010-02-28T23:53:29Z","timestamp":1267401209000},"page":"179-195","source":"Crossref","is-referenced-by-count":2,"title":["A Uniform Reduction Equivalence for Process Calculi"],"prefix":"10.1007","author":[{"given":"Zining","family":"Cao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0304-3975(93)90152-J","volume":"114","author":"G. Boudol","year":"1993","unstructured":"Boudol, G., Castellani, I., Hennessy, M., Kiehn, A.: Observing localities. Theoretical Computer Science\u00a0114, 31\u201361 (1993)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"12_CR2","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.D.: Mobile Ambients. Theoretical Computer Science\u00a0240(1), 177\u2013213 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0304-3975(95)00074-7","volume":"152","author":"K. Honda","year":"1995","unstructured":"Honda, K., Yoshida, N.: On reduction-based process semantics. Theoretical Computer Science\u00a0152(2), 437\u2013486 (1995)","journal-title":"Theoretical Computer Science"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Levi, F., Sangiorgi, D.: Controlling interference in Ambients. In: Proc. POPL 2000, Boston, Massachusetts, January 19-21, pp. 352\u2013364 (2000)","DOI":"10.1145\/325694.325741"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Merro, M., Hennessy, M.: Bisimulation congruences in Safe Ambients. Computer Science Report 5\/01; An extended abstract appear in Proc. POPL (2002)","DOI":"10.1145\/503272.503280"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Merro, M., Zappa Nardelli, F.: Bisimulation proof methods for Mobile Ambients. Technical Report COGS 01 (2003)","DOI":"10.1007\/3-540-45061-0_47"},{"key":"12_CR7","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 processes (Part I and II). Information and Computation\u00a0100, 1\u201377 (1992)","journal-title":"Information and Computation"},{"key":"12_CR8","unstructured":"Sangiorgi, D.: Expressing mobility in process algebras: first-order and higher-order paradigms, Ph.D thesis, Department of Computer Science, University of Einburgh (1992)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D.: Bisimulation in higher-order calculi. Information and Computation\u00a0131(2) (1996)","DOI":"10.1006\/inco.1996.0096"},{"key":"12_CR10","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":"12_CR11","doi-asserted-by":"crossref","unstructured":"Vigliotti, M.G., Phillips, I.: Barbs and congruences for Safe Mobile Ambients. In: Foundations of Wide Area Network Computing (July 2002)","DOI":"10.1016\/S1571-0661(04)80415-8"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30477-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T13:17:36Z","timestamp":1558876656000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30477-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540237242","9783540304777"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30477-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}