{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:17:06Z","timestamp":1725664626972},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614401"},{"type":"electronic","value":"9783540685807"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61440-0_153","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:38:25Z","timestamp":1330274305000},"page":"490-501","source":"Crossref","is-referenced-by-count":3,"title":["Mobile processes with a distributed environment"],"prefix":"10.1007","author":[{"given":"Chiara","family":"Bodei","sequence":"first","affiliation":[]},{"given":"Pierpaolo","family":"Degano","sequence":"additional","affiliation":[]},{"given":"Corrado","family":"Priami","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"M. Boreale and D. Sangiorgi. A fully abstract semantics of causality in the \u03c0-calculus. In Proceedings of STAGS'95, LNCS. Springer Verlag, 1995.","DOI":"10.1007\/3-540-59042-0_77"},{"key":"41_CR2","doi-asserted-by":"crossref","unstructured":"Roberta Borgia, Pierpaolo Degano, Corrado Priami, Lone Leth, and Bent Thomsen. Understanding mobile agents via a non-interleaving semantics for Facile. Technical Report ECRC-96-4, European Computer-Industry Research Centre, 1996.","DOI":"10.1007\/3-540-61739-6_36"},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"Ph. Darondeau and P. Degano. Causal trees. In Proceedings of ICALP'89, LNCS 372, pages 234\u2013248. Springer-Verlag, 1989.","DOI":"10.1007\/BFb0035764"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"P. Degano and C. Priami. Proved trees. In Proceedings of ICALP'92, LNCS 623, pages 629\u2013640. Springer-Verlag, 1992.","DOI":"10.1007\/3-540-55719-9_110"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"P. Degano and C. Priami. Causality for mobile processes. In Proceedings of ICALP'95, LNCS 944, pages 660\u2013671. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60084-1_113"},{"key":"41_CR6","unstructured":"A. Giacalone, P. Mishra, and S. Prasad. Operational and algebraic semantics for Facile: A symmetric integration of concurrent and functional programming. In Proceedings ICALP'90, LNCS 443, pages 765\u2013780. Springer-Verlag, 1990."},{"key":"41_CR7","unstructured":"R. Milner. The polyadic \u03c0-calculus: a tutorial. Technical Report ECS-LFCS-91-180, University of Edinburgh, 1991."},{"key":"41_CR8","unstructured":"R. Milner, D. Berry, and D. Turner. A semantics for ML concurrency primitives. In Proceedings of POPL'92, 1992."},{"issue":"1","key":"41_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes (I and II). Information and Computation, 100(1):1\u201377, 1992.","journal-title":"Information and Computation"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"F. Orava and J. Parrow. An algebraic verification of a mobile network. Formal Aspects of Computing, pages 497\u2013543, 1992.","DOI":"10.1007\/BF01211473"},{"key":"41_CR11","unstructured":"J. Reppy. Higher order concurrency. PhD thesis, Cornell University, TR 92-1285, 1992."},{"key":"41_CR12","unstructured":"D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, University of Edinburgh, 1992."},{"key":"41_CR13","unstructured":"B. Thomsen, L. Leth, S. Prasad, T.-M. Kuo, A. Kramer, F. Knabe, and A. Giacalone. Facile Antigua Release Programming Guide. Technical Report ECRC-93-20, European Computer-Industry Research Centre, 1993."},{"key":"41_CR14","unstructured":"D. Walker. Objects in the \u03c0-calculus. Information and Computation, 1994. To appear."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61440-0_153.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:06:18Z","timestamp":1605629178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61440-0_153"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614401","9783540685807"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-61440-0_153","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}