Abstract
We embed the transition system of the Mobile Ambients into the transition system of a subset of the π-calculus. The basic idea, applicable to other calculi as well, is to constrain the deduction of the π-calculus transitions with the suitable conditions that reflect the nesting of ambients.
Work partially supported by EU-project DEGAS (IST-2001-32072) and the Progetto MIUR Metodi Formali per la Sicurezza e il Tempo (MEFISTO).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Brodo, L., Degano, P., Priami, C.: A tool for quantitative analysis of π-calculus processes. In: Gorrieri, R. (ed.) Proceedings of Process Algebra and Performance Modelling (PAPM 2000), Geneva, Carleton Scientific (2000)
Brodo, L., Priami, C.: Performance considerations on the wap secure transpor layer. In: Nowak, D. (ed.) Proceedings of Automated Verification of Critical Systems (AVoCS 2001), Oxford, UK (2001)
Bugliesi, M., Castagna, G., Crafa, S.: Access control for mobile agents: The calculus of boxed ambients. ACM Transactions on Programming Languages and Systems (to appear)
Cardelli, L., Ghelli, G., Gordon, A.D.: Mobility types for mobile ambients. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 230–239. Springer, Heidelberg (1999)
Cardelli, L., Gordon, A.: Mobile Ambients. Theoretical Computer Science 240/1, 177–213 (2000)
Conchon, S., Le Fessant, F.: Jocaml: Mobile agents for objective-caml. In: Proceedings of Agent Systems and Applications and International Symposium on Mobile Agents (ASA/MA 1999), Palm Springs, California, USA, pp. 22–29. IEEE Computer Society, Los Alamitos (1999)
Crafa, S., Bugliesi, M., Castagna, G.: Information Flow Security in Boxed Ambients. In: Proceedings of Foundations of Wide Area Network Computing (FWAN 2002), Malaga, Spain. ENTCS, vol. 3, Elsevier, Amsterdam (2002)
Degano, P., Priami, C.: Non-interleaving semantics for mobile processes. Theoretical Computer Science 216(1-2), 237–270 (1999)
Degano, P., Priami, C.: Enhanced operational semantics: a tool for describing and analyzing concurrent systems. ACM Computing Surveys 33(2), 135–176 (2001)
Fournet, C., Gonthier, G.: The reflexive chemical abstract machine and the join-calculus. In: Proceedings of Principles of Programming Languages (POPL 1996), St. Petersburg Beach, Florida, USA, pp. 372–385. ACM Press, New York (1996)
Fournet, C., Gonthier, G.: The Join Calculus: A language for distributed mobile programming. In: Barthe, G., Dybjer, P., Pinto, L., Saraiva, J. (eds.) APPSEM 2000. LNCS, vol. 2395, pp. 268–332. Springer, Heidelberg (2002)
Fournet, C., Levy, J.J., Schmitt, A.: An asynchronous, distributed implementation of mobile ambients. In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol. 1872, pp. 348–364. Springer, Heidelberg (2000)
Guan, X., You, J.: Encoding channels in typed ambients (unpublished manuscript)
Hennessy, M., Riely, J.: Resource access control in systems of mobile agents. Information and Computation 173(1), 82–120 (2002)
Levi, F., Sangiorgi, D.: Controlling interference in ambients. In: Proceedings of Principles of Programming Languages (POPL 2000), Boston, Massachusetts, USA, pp. 352–364. ACM Press, New York (2000)
Milner, R.: Communicating and Mobile Systems: The π Calculus. Cambridge University Press, Cambridge (1999)
Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. Information and Computation 100(1), 1–77 (1992)
Sangiorgi, D.: Expressing Mobility in Process Algebra. PhD thesis, University of Edinburgh, Edinburgh, U.K. (1993)
Sewell, P.: Global/local subtyping and capability inference for a distributed π-calculus. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, p. 695. Springer, Heidelberg (1998)
Thomsen, B.: A calculus of higher order communicating systems. In: Proceedings of Principles of Programming Languages (POPL 1989), Austin, Texas, USA, pp. 143–154. ACM Press, New York (1989)
Thomsen, B.: Plain CHOCS: A second generation calculus for higher order processes. Acta Informatica 30(1), 1–59 (1993)
Thomsen, B., Leth, L., Kuo, T.-M.: A facile tutorial. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 278–298. Springer, Heidelberg (1996)
Victor, B., Moller, F.: The Mobility Workbench — A tool for the π-calculus. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 428–440. Springer, Heidelberg (1994)
Zimmer, P.: On the Expressiveness of Pure Mobile Ambients. Mathematical Structures of Computer Science 13 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brodo, L., Degano, P., Priami, C. (2003). Reflecting Mobile Ambients into the π-Calculus. In: Priami, C. (eds) Global Computing. Programming Environments, Languages, Security, and Analysis of Systems. GC 2003. Lecture Notes in Computer Science, vol 2874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40042-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-40042-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20583-8
Online ISBN: 978-3-540-40042-4
eBook Packages: Springer Book Archive