{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T06:57:24Z","timestamp":1758265044492},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2007,2,28]],"date-time":"2007-02-28T00:00:00Z","timestamp":1172620800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2007,3,9]]},"DOI":"10.1007\/s00236-007-0038-z","type":"journal-article","created":{"date-parts":[[2007,2,27]],"date-time":"2007-02-27T15:17:56Z","timestamp":1172589476000},"page":"535-594","source":"Crossref","is-referenced-by-count":10,"title":["Fair ambients"],"prefix":"10.1007","volume":"43","author":[{"given":"Yuxi","family":"Fu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,2,28]]},"reference":[{"key":"38_CR1","unstructured":"Abramsky, S.: The lazy lambda calculus. In: Turner, D. (ed.) Declarative Programming, pp. 65\u2013116. Addison-Wesley (1988)"},{"key":"38_CR2","unstructured":"Barendregt, H.: The lambda calculus: its syntax and semantics, Studies in Logic and Foundations of Mathematics, North-Holland (1984)"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Boneva, I., Talbot, J.: When ambients cannot be opened. In: Gordon, A. (ed.) FoSSaCS 2003, pp. 169\u2013184, Lecture Notes in Computer Science, vol. 2620 (2003)","DOI":"10.1007\/3-540-36576-1_11"},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"Bugliesi, M., Castagna, G., Crafa, S.: Boxed ambients. In: Kobayashi, N., Pierce, B. (eds.) TACS 2001, pp. 38\u201363, Lecture Notes in Computer Science, vol. 2215 (2001)","DOI":"10.1007\/3-540-45500-0_2"},{"key":"38_CR5","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1016\/j.tcs.2003.10.040","volume":"322","author":"N. Busi","year":"2004","unstructured":"Busi N. and Zavattaro G. (2004). On the expressive power of movement and restriction in pure mobile ambients. Theor. Comput. Sci. 322: 477\u2013515","journal-title":"Theor. Comput. Sci."},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"Cardelli, L.: Abstraction for mobile computation. In: Secure Internet Programming: Security Issues for Mobile and Distributed Object, pp. 51\u201394, Lecture Notes in Computer Science, vol. 1603 (1999)","DOI":"10.1007\/3-540-48749-2_4"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Cardelli, L.: Brane calculi. In: Danos, V., Sch\u00e4chter, V. (eds.) International Conference on Computational Methods in System Biology, Paris, May 26\u201328, 2004, Lecture Notes in Computer Science, vol. 3082 (2005)","DOI":"10.1007\/978-3-540-25974-9_24"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Gordon, A.: Mobile ambients. In: Nivat, M. (ed.) FoSSaCS 1998, pp. 140\u2013155 Lecture Notes in Computer Science, vol. 1378, (1998)","DOI":"10.1007\/BFb0053547"},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Gordon, A.: Types for mobile ambients. In: POPL 1999, pp. 79\u201392. ACM (1999)","DOI":"10.1145\/292540.292550"},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Gordon, A.: Anytime, anywhere: modal logics for mobile ambients. In: POPL 2000, pp. 365\u2013377. ACM (2000)","DOI":"10.1145\/325694.325742"},{"key":"38_CR11","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0304-3975(99)00231-5","volume":"240","author":"L. Cardelli","year":"2000","unstructured":"Cardelli L. and Gordon A. (2000). Mobile ambients. Theor. Comput. Sci. 240: 177\u2013213","journal-title":"Theor. Comput. Sci."},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Ghelli, G., Gordon, A.: Mobility types for mobile ambients. In: Wiedermann, J., Emde Boas, P., Nielsen, M. (eds.) ICALP 1999, pp. 230\u2013239, Lecture Notes in Computer Science (1999)","DOI":"10.1007\/3-540-48523-6_20"},{"key":"38_CR13","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/S0304-3975(99)00037-7","volume":"221","author":"Y. Fu","year":"1999","unstructured":"Fu Y. (1999). Variations on mobile processes. Theor. Comput. Sci. 221: 327\u2013368","journal-title":"Theor. Comput. Sci."},{"key":"38_CR14","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0890-5401(03)00061-0","volume":"184","author":"Y. Fu","year":"2003","unstructured":"Fu Y. (2003). Bisimulation congruences of chi calculus. Inf. Comput. 184: 201\u2013226","journal-title":"Inf. Comput."},{"key":"38_CR15","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.tcs.2004.10.041","volume":"338","author":"Y. Fu","year":"2005","unstructured":"Fu Y. (2005). On quasi open bisimulation. Theor. Comput. Sci. 338: 96\u2013126","journal-title":"Theor. Comput. Sci."},{"key":"38_CR16","unstructured":"Fu, Y.: Checking equivalences for higher order process, working paper (2006)"},{"key":"38_CR17","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0304-3975(03)00202-0","volume":"308","author":"Y. Fu","year":"2003","unstructured":"Fu Y. and Yang Z. (2003). Tau laws for pi calculus. Theor. Comput. Sci. 308: 55\u2013130","journal-title":"Theor. Comput. Sci."},{"key":"38_CR18","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0020-0190(01)00172-7","volume":"80","author":"X. Guan","year":"2001","unstructured":"Guan X., Yang Y. and You J. (2001). Typing evolving ambients. Inf. Process. Lett. 80: 265\u2013270","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"38_CR19","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1017\/S0960129502003742","volume":"13","author":"A. Gordon","year":"2003","unstructured":"Gordon A. and Cardelli L. (2003). Equational properties of mobile ambients. Math. Struct. Comput. Sci. 13(3): 371\u2013408","journal-title":"Math. Struct. Comput. Sci."},{"key":"38_CR20","doi-asserted-by":"crossref","unstructured":"Levi, F., Sangiorgi, D.: Controlling interference in ambients. In: POPL 2000, pp. 352\u2013364. ACM (2000)","DOI":"10.1145\/325694.325741"},{"key":"38_CR21","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/j.tcs.2004.10.007","volume":"330","author":"S. Maffeis","year":"2005","unstructured":"Maffeis S. and Phillips I. (2005). On the computational strength of pure ambient calculi. Theor. Comput. Sci. 330: 501\u2013551","journal-title":"Theor. Comput. Sci."},{"key":"38_CR22","doi-asserted-by":"crossref","unstructured":"Merro, M., Hennessy, M.: Bisimulation congruences in safe ambients. In: POPL 2002, pp. 71\u201380. ACM (2002)","DOI":"10.1145\/503272.503280"},{"issue":"2","key":"38_CR23","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1145\/1119479.1119482","volume":"28","author":"M. Merro","year":"2006","unstructured":"Merro M. and Hennessy M. (2006). A bisimulation-based semantic theory of safe ambients. ACM Trans. Program. Languages Systems 28(2): 290\u2013330","journal-title":"ACM Trans. Program. Languages Systems"},{"key":"38_CR24","doi-asserted-by":"crossref","unstructured":"Merro, M., Zappa Nardelli, F.: Bisimulation proof methods for mobile ambients. In: Baeten, J., Lenstra, J., Parrow, J., Woeginger, G. (eds.) ICALP 2003, pp. 584\u2013598, Lecture Notes in Computer Science, vol. 2719 (2003)","DOI":"10.1007\/3-540-45061-0_47"},{"issue":"6","key":"38_CR25","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1145\/1101821.1101825","volume":"52","author":"M. Merro","year":"2005","unstructured":"Merro M. and Zappa Nardelli F. (2005). Behavioural theory for mobile ambients. J. ACM 52(6): 961\u20131023","journal-title":"J. ACM"},{"key":"38_CR26","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner R. (1989). Communication and Concurrency. Prentice Hall, New Jersey"},{"key":"38_CR27","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1017\/S0960129500001407","volume":"2","author":"R. Milner","year":"1992","unstructured":"Milner R. (1992). Functions as processes. Math. Struct. Comput. Sci. 2: 119\u2013146","journal-title":"Math. Struct. Comput. Sci."},{"key":"38_CR28","doi-asserted-by":"crossref","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. In: Information and Computation, vol. 100, pp. 1\u201340 (Part I), pp. 41\u201377 (Part II). Academic, New York (1992)","DOI":"10.1016\/0890-5401(92)90009-5"},{"key":"38_CR29","doi-asserted-by":"crossref","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Dershowitz, N., Lindenstrauss, N. (eds.) ICALP 1992, pp. 685\u2013695, Lecture Notes in Computer Science, vol. 623 (1992)","DOI":"10.1007\/3-540-55719-9_114"},{"key":"38_CR30","doi-asserted-by":"crossref","unstructured":"Nestmann, U.: Welcome to the jungle: a subjective guide to mobile process calculi. In: Bauer, C., Hermanns, H. (eds.) CONCUR 2006, pp. 52\u201363, Lecture Notes in Computer Science, vol. 4137 (2006)","DOI":"10.1007\/11817949_4"},{"key":"38_CR31","doi-asserted-by":"crossref","unstructured":"Phillips, I., Vigliotti, M.: On reduction semantics for the push and pull ambient calculus. In: TCS 2002, IFIP 17th World Computer Congress, Montreal. Kluwer (2002)","DOI":"10.1007\/978-0-387-35608-2_45"},{"key":"38_CR32","doi-asserted-by":"crossref","unstructured":"Phillips, I., Vigliotti, M.: Electoral systems in ambient calculi. In: Walukiewicz, I. (ed.) FoSSaCS 2004, pp. 408\u2013422, Lecture Notes in Computer Science, vol. 2987 (2004)","DOI":"10.1007\/978-3-540-24727-2_29"},{"issue":"1","key":"38_CR33","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.tcs.2004.03.061","volume":"325","author":"A. Regev","year":"2004","unstructured":"Regev A., Panina E., Silverman W., Cardelli L. and Shapiro E. (2004). Bioambients: an abstraction for biological compartments. Theor. Comput. Sci. 325(1): 141\u2013167","journal-title":"Theor. Comput. Sci."},{"key":"38_CR34","unstructured":"Sangiorgi, D.: Expressing mobility in process algebras: first-order and higher-order paradigms, PhD thesis, University of Edinburgh (1993)"},{"key":"38_CR35","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D.: From \u03c0-calculus to higher order \u03c0-calculus-and back. In: Gaudel, M., Jouannaud, J. (eds.) TAPSOFT\u201993, pp. 151-166, Lecture Notes in Computer Science, vol. 668 (1993)","DOI":"10.1007\/3-540-56610-4_62"},{"key":"38_CR36","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1006\/inco.1994.1042","volume":"111","author":"D. Sangiorgi","year":"1994","unstructured":"Sangiorgi D. (1994). The lazy lambda calculus in a concurrency scenario. Inf. Comput. 111: 120\u2013153","journal-title":"Inf. Comput."},{"key":"38_CR37","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s002360050036","volume":"3","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi D. (1996). A theory of bisimulation for \u03c0-calculus. Acta Inf. 3: 69\u201397","journal-title":"Acta Inf."},{"issue":"2","key":"38_CR38","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1006\/inco.1996.0096","volume":"131","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi D. (1996). Bisimulation for higher order process calculi. Inf. Comput. 131(2): 141\u2013178","journal-title":"Inf. Comput."},{"key":"38_CR39","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D., Milner, R.: Techniques of \u201cWeak Bisimulation Up To\u201d. In: Cleaveland, W. (ed.) CONCUR 1992, pp. 32\u201346, Lecture Notes in Computer Science, vol. 630 (1992)","DOI":"10.1007\/BFb0084781"},{"key":"38_CR40","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D., Walker, D.: On barbed equivalence in \u03c0-calculus. In: Larsen, K., Nielsen, M. (eds.) CONCUR 2001, pp. 292\u2013304, Lecture Notes in Computer Science, vol. 2154 (2001)","DOI":"10.1007\/3-540-44685-0_20"},{"key":"38_CR41","unstructured":"Sangiorgi, D., Walker, D.: The Pi Calculus\u2014A Theory of Mobile Processes. CUP (2001)"},{"key":"38_CR42","doi-asserted-by":"crossref","unstructured":"Teller, D., Zimmer, P., Hirschcoff, D.: Using ambients to control resources. In: Brim, L., Jancar, P., Kretinsky, M., Kucera, A. (eds.) CONCUR 2002, pp. 288\u2013303, Lecture Notes in Computer Science, vol. 2421 (2002)","DOI":"10.1007\/3-540-45694-5_20"},{"key":"38_CR43","doi-asserted-by":"crossref","unstructured":"Vigliotti, M., Phillips, I.: Barbs and congruemces for safe mobile ambients. Electr. Notes Theor. Comput. Sci. 66(3) (2002)","DOI":"10.1016\/S1571-0661(04)80415-8"},{"key":"38_CR44","doi-asserted-by":"crossref","unstructured":"Zimmer, P.: On the expressiveness of pure mobile ambients. Electr. Notes Theor. Comput. Sci. 39(1) (2000)","DOI":"10.1016\/S1571-0661(05)82506-X"},{"issue":"5","key":"38_CR45","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1017\/S0960129503004079","volume":"13","author":"P. Zimmer","year":"2003","unstructured":"Zimmer P. (2003). On the expressiveness of pure safe ambients. Math. Struct. Comput. Sci. 13(5): 721\u2013770","journal-title":"Math. Struct. Comput. Sci."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-007-0038-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-007-0038-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-007-0038-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T13:41:54Z","timestamp":1558705314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-007-0038-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,2,28]]},"references-count":45,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2007,3,9]]}},"alternative-id":["38"],"URL":"https:\/\/doi.org\/10.1007\/s00236-007-0038-z","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,2,28]]}}}