{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T00:35:55Z","timestamp":1794357355258,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":22,"publisher":"Springer US","isbn-type":[{"value":"9780387096797","type":"print"},{"value":"9780387096803","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-09680-3_34","type":"book-chapter","created":{"date-parts":[[2008,7,21]],"date-time":"2008-07-21T07:37:14Z","timestamp":1216625834000},"page":"507-520","source":"Crossref","is-referenced-by-count":2,"title":["Deconstructing behavioural theories of mobility"],"prefix":"10.1007","author":[{"given":"Julian","family":"Rathke","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pawe\u0142","family":"Soboci\u0144ski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"34_CR1","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0304-3975(97)00223-5","volume":"195","author":"R. Amadio","year":"1998","unstructured":"R. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous pi-calculus. Theoretical Computer Science, 195(2):291\u2013324, 1998.","journal-title":"Theoretical Computer Science"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"M. Boreale and D. Sangiorgi. Bisimulation in name-passing calculi without matching. In IEEE Symposium on Logic in Computer Science LiCS, 1998.","DOI":"10.1109\/LICS.1998.705653"},{"key":"34_CR3","unstructured":"G. Boudol. Asynchrony and the \u03c0-calculus. Technical Report 1702, INRIA, Sophia-Antipolis, 1991."},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"R. Bruni and U. Montanari. Cartesian closed double categories, their lambda-notation, and the Pi-calculus. In IEEE Symposium on Logic in Computer Science LiCS, 1999.","DOI":"10.1109\/LICS.1999.782620"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"L. Cardelli and A. Gordon. Mobile ambients. In Foundations of Software Science and Computation Structures, FoSSaCS, LNCS. Springer-Verlag, 1998.","DOI":"10.1007\/BFb0053547"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"U. Engberg and M. Nielsen. A calculus of communicating systems with label passing. Technical Report DAIMI PB-208, University of Aarhus, May 1986.","DOI":"10.7146\/dpb.v15i208.7559"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"C. Fournet and G. Gonthier. A hierarchy of equivalences for asynchronous calculi. In International Colloquium on Automata, Languages and Programming ICALP, volume 1443 of LNCS. Springer-Verlag, 1998.","DOI":"10.1007\/BFb0055107"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"K. Honda and M. Tokoro. An object calculus for asynchronous communication. In European Conference on Object-Oriented Programming ECOOP, 1991.","DOI":"10.1007\/BFb0057019"},{"issue":"2","key":"34_CR9","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0304-3975(95)00074-7","volume":"152","author":"K. Honda","year":"1995","unstructured":"K. Honda and N. Yoshida. On reduction-based process semantics. Theoretical Computer Science, 152(2):437\u2013486, 1995.","journal-title":"Theoretical Computer Science"},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"1:4","DOI":"10.2168\/LMCS-1(1:4)2005","volume":"1","author":"A.S.A. Jeffrey","year":"2005","unstructured":"A.S.A. Jeffrey and J. Rathke. Contextual equivalence for higher-order pi-calculus revisited. Logical Methods in Computer Science, 1(1:4), 2005.","journal-title":"Logical Methods in Computer Science"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"B. Klin, V. Sassone, and P. Soboci\u0144ski. Labels from reductions: towards a general theory. In Conference on Algebra and Coalgebra in Computer Science Calco, volume 3629 of LNCS, pages 30\u201350. Springer, 2005.","DOI":"10.1007\/11548133_2"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"J. Leifer and R. Milner. Deriving bisimulation congruences for reactive systems. In International Conference on Concurrency Theory Concur, volume 1877 of LNCS, pages 243\u2013258. Springer, 2000.","DOI":"10.1007\/3-540-44618-4_19"},{"key":"34_CR13","unstructured":"R. Milner. Communicating and Mobile Systems: the \u03c0-calculus. CUP, 1999."},{"issue":"1","key":"34_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0890-5401(92)90009-5","volume":"100","author":"R. Milner","year":"1992","unstructured":"R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, II. Information and Computation, 100(1):41\u201377, 1992.","journal-title":"Information and Computation"},{"key":"34_CR15","unstructured":"G. D. Plotkin. A structural approach to operational semantics. Technical Report FN-19, DAIMI, Computer Science Department, Aarhus University, 1981."},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"J. Rathke and P. Soboci\u2019nski. Deriving structural labelled transitions for mobile ambients, 2008. Submitted for publication.","DOI":"10.1007\/978-3-540-85361-9_36"},{"issue":"2","key":"34_CR17","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1006\/inco.1996.0096","volume":"131","author":"D. Sangiorgi","year":"1996","unstructured":"D. Sangiorgi. Bisimulation for higher-order process calculi. Information and Computation, 131(2):141\u2013178, 1996.","journal-title":"Information and Computation"},{"key":"34_CR18","unstructured":"D. Sangiorgi and D. Walker. The \u03c0-calculus. CUP, 2001."},{"key":"34_CR19","doi-asserted-by":"crossref","unstructured":"D. Sangiorgi and D. Walker. Some results on barbed equivalences in pi-calculus. In International Conference on Concurrency Theory CONCUR, volume 2154 of LNCS. Springer-Verlag, 2001.","DOI":"10.1007\/3-540-44685-0_20"},{"issue":"1-2","key":"34_CR20","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.tcs.2004.10.025","volume":"333","author":"V. Sassone","year":"2005","unstructured":"V. Sassone and P. Soboci\u0144ski. Locating reaction with 2-categories. Theoretical Computer Science, 333(1-2):297\u2013327, 2005.","journal-title":"Theoretical Computer Science"},{"issue":"1\u20132","key":"34_CR21","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0304-3975(00)00309-1","volume":"274","author":"Sewell. Peter","year":"2002","unstructured":"Peter Sewell. From rewrite rules to bisimulation congruences. Theoretical Computer Science, 274(1\u20132):183\u2013230, 2002.","journal-title":"Theoretical Computer Science"},{"key":"34_CR22","doi-asserted-by":"crossref","unstructured":"A. Ziegler, D. Miller, and C. Palamidessi. A congruence format for name-passing calculi. In Workshop on Structural Operational Semantics SOS, volume 156 of ENTCS, pages 169\u2013189, 2006.","DOI":"10.1016\/j.entcs.2005.09.032"}],"container-title":["IFIP International Federation for Information Processing","Fifth Ifip International Conference On Theoretical Computer Science \u2013 Tcs 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-09680-3_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:44:38Z","timestamp":1619559878000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-09680-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387096797","9780387096803"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-09680-3_34","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-0-387-09680-3","asserted-by":"object"}]},"ISSN":["1571-5736"],"issn-type":[{"value":"1571-5736","type":"print"}],"subject":[]}}