Abstract
We develop a semantics theory for SAP, a variant of Levi and Sangiorgi's Safe Ambients, SA.The dynamics of SA relies upon capabilities (and co-capabilities) exercised by mobile agents, called ambients, to interact with each other. These capabilities contain references, the names of ambients with which they wish to interact. In SAP we generalize the notion of capability: in order to interact with an ambient n, an ambient m must exercise a capability indicating both n and a password h to access n; the interaction between n and m takes place only if n is willing to perform a corresponding co-capability with the same password h. The name h can also be looked upon as a port to access ambient n via port h.In SAP, by managing passwords/ports, for example generating new ones and distributing them selectively, an ambient may now program who may migrate into its computation space, and when. Moreover in SAP, an ambient may provide different services/resources depending on the port accessed by the incoming clients. Then we give an lts-based operational semantics for SAP and a labelled bisimulation equivalence, which is proved to coincide with reduction barbed congruence.We use our notion of bisimulation to prove a set of algebraic laws that are subsequently exploited to prove more significant examples.
- Amadio, R., Castellani, I., and Sangiorgi, D. 1998. On bisimulations for the asynchronous π-calculus. Theoretical Computer Science 195, 291--324.]] Google Scholar
Digital Library
- Bugliesi, M., Castagna, G., and Crafa, S. 2001. Boxed ambients. In Proceedings of the 4th TACS. LNCS, vol. 2215. Springer Verlag.]] Google Scholar
Digital Library
- Bugliesi, M., Crafa, S., Merro, M., and Sassone, V. 2005. Communication interference in mobile boxed ambients. J. Information and Computation 202(1). An extended abstract appeared in Proceedings of FSTTCS'02, LNCS, Springer Verlag.]]Google Scholar
- Cardelli, L. and Gordon, A. 1996. A commitment relation for the ambient calculus. Unpublished notes.]]Google Scholar
- Cardelli, L. and Gordon, A. 2000. Mobile ambients. Theoretical Computer Science 240, 1, 177--213. An extended abstract appeared in Proceedings of the FoSSaCS '98.]] Google Scholar
Digital Library
- Cardelli, L. and Gordon, A. D. 1999. Types for mobile ambients. In Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, 79--92.]] Google Scholar
Digital Library
- Castagna, G. and Zappa Nardelli, F. 2002. The seal calculus revisited: Contextual equivalence and bisimilarity. In Proceedings of the 22nd FSTTCS '02. LNCS, vol. 2556. Springer Verlag.]] Google Scholar
Digital Library
- Ferrari, G., Montanari, U., and Tuosto, E. 2001. A LTS semantics of ambients via graph synchronization with mobility. In Proceedings of ICTCS. LNCS, vol. 2202. Springer Verlag.]] Google Scholar
Digital Library
- Godskesen, J., Hildebrandt, T., and Sassone, V. 2002. A calculus of mobile resources. In Proceedings of the 10th CONCUR '02. LNCS, vol. 2421. Springer Verlag.]] Google Scholar
Digital Library
- Gordon, A. D. and Cardelli, L. 2002. Equational properties of mobile ambients. J. Math. Struct. Comput. Sci. 12, 1--38. An extended abstract appeared in Proceedings of FoSSaCs '99.]] Google Scholar
Digital Library
- Hennessy, M., Merro, M., and Rathke, J. 2003. Towards a behavioural theory of access and mobility control in distributed system. In Proceedings of the 5th FoSSaCS '03. LNCS. Springer Verlag.]]Google Scholar
- Hennessy, M., Rathke, J., and Yoshida, N. 2003. Safedpi: A language for controlling mobile code. Computer Science Report 2003:02, University of Sussex. An extended abstract appeared in the Proceedings of FOSSACS'04, volume 2987, Lecture Notes in Computer Science. Springer-Verlag 2004.]]Google Scholar
- Hennessy, M. and Riely, J. 1998. A typed language for distributed mobile processes. In Proceedings of the 25th POPL. ACM Press.]] Google Scholar
Digital Library
- Honda, K. and Yoshida, N. 1994. Replication in Concurrent Combinators. In Proceedings of TACS'94. LNCS, vol. 789. Springer Verlag.]] Google Scholar
Digital Library
- Honda, K. and Yoshida, N. 1995. On reduction-based process semantics. Theoretical Computer Science 152, 2, 437--486.]] Google Scholar
Digital Library
- Jensen, O. H. and Milner, R. 2004. Bigraphs and mobile processes (revised). Tech. Rep. 580, LFCS, Dept. of Comp. Sci., Edinburgh Univ. Feb. An extended abstract appeared in Conference Record of the 30th Symposium on Principles of Programming Languages, ACM Press, 2003.]]Google Scholar
- Leifer, J. J. and Milner, R. 2000. Deriving bisimulation congruences for reactive systems. In CONCUR 2000---Concurrency Theory, 11th International Conference, University Park, PA, USA, August 22--25, 2000, Proceedings. LNCS, vol. 1877. Springer-Verlag, 243--258.]] Google Scholar
Digital Library
- Levi, F. and Sangiorgi, D. 2000. Controlling interference in ambients. An extended abstract appeared in Proceedings of the 27th Symposium on Principles of Programming Languages, ACM Press.]] Google Scholar
Digital Library
- Merro, M. and Hennessy, M. 2002. Bisimulation congruences in safe ambients. In Proceedings of the 29th POPL '02. ACM Press.]] Google Scholar
Digital Library
- Merro, M. and Zappa Nardelli, F. 2005. Behavioural theory for mobile ambients. J. ACM 52, 6, 961--1023.]] Google Scholar
Digital Library
- Milner, R. 1989. Communication and Concurrency. Prentice Hall.]] Google Scholar
Digital Library
- Milner, R. 1991. The polyadic π-calculus: a tutorial. Tech. Rep. ECS-LFCS-91-180, LFCS, Dept. of Comp. Sci., Edinburgh Univ. Oct. Also in Logic and Algebra of Specification, ed. F. L. Bauer, W. Brauer and H. Schwichtenberg, Springer Verlag, 1993.]]Google Scholar
- Milner, R., Parrow, J., and Walker, D. 1992. A calculus of mobile processes, (Parts I and II). Information and Computation 100, 1--77.]] Google Scholar
Digital Library
- Milner, R. and Sangiorgi, D. 1992. Barbed bisimulation. In Proceedings of the 19th ICALP. LNCS, vol. 623. Springer Verlag, 685--695.]] Google Scholar
Digital Library
- Phillips, A. 2005. The channel ambient calculus: From process algebra to mobile code. Ph.D. thesis, Imperial College London.]]Google Scholar
- Phillips, A., Yoshida, N., and Eisenbach, S. 2004. A distributed abstract machine for boxed ambient calculi. In Proceedings of ESOP. LNCS, vol. 2987. Springer Verlag.]]Google Scholar
- Sangiorgi, D. 1992. Expressing mobility in process algebras: First-order and higher-order paradigms. Ph.D. thesis, Department of Computer Science, University of Edinburgh.]]Google Scholar
- Sangiorgi, D. 1994. The lazy lambda calculus in a concurrency scenario. Information and Computation 111, 1, 120--153.]] Google Scholar
Digital Library
- Sangiorgi, D. 1996. Bisimulation for Higher-Order Process Calculi. Information and Computation 131, 2, 141--178.]] Google Scholar
Digital Library
- Sangiorgi, D. 2001. Extensionality and intensionality of the ambient logic. In Proceedings of the 28th POPL. ACM Press.]] Google Scholar
Digital Library
- Sangiorgi, D. and Milner, R. 1992. The problem of “Weak Bisimulation up to”. In Proceedings of CONCUR '92. LNCS, vol. 630. Springer Verlag, 32--46.]] Google Scholar
Digital Library
- Sangiorgi, D. and Walker, D. 2001a. The π-calculus: a Theory of Mobile Processes. Cambridge University Press.]] Google Scholar
Digital Library
- Sangiorgi, D. and Walker, D. 2001b. Some results on barbed equivalences in pi-calculus. In Proceedings of CONCUR '01. LNCS, vol. 2154. Springer Verlag.]] Google Scholar
Digital Library
- Schmitt, A. and Stefani, J. 2004. The kell calculus: A family of higher-order distributed process calculi. In LNCS. Springer-Verlag. Workshop of Global Computing 2004.]]Google Scholar
- Unyapoth, A. and Sewell, P. 2001. Nomadic Pict: Correct communication infrastructures for mobile computation. In Proceedings of the 28th POPL. ACM Press.]] Google Scholar
Digital Library
- Vigliotti, M. G. September 1999. Transition systems for the ambient calculus. Master thesis, Imperial College of Science, Technology and Medicine (University of London).]]Google Scholar
- Vigliotti, M. G. and Phillips, A. 2002. Barbs and congruences for safe mobile ambients. In Electronic Notes in Theoretical Computer Science. Vol. 66. Elsevier.]]Google Scholar
- Vitek, J. and Castagna, G. 1999. Seal: A framework for secure mobile computations. In Internet Programming Languages. Number 1686 in LNCS. Springer Verlag, 47--77.]] Google Scholar
Digital Library
Index Terms
A bisimulation-based semantic theory of Safe Ambients
Recommendations
Bisimulation on speed: a unified approach
Two process-algebraic approaches have been developed for comparing two bisimulation-equivalent processes with respect to speed: the one of Moller/Tofts equips actions with lower time bounds, while the other by Lüttgen/Vogler considers upper time bounds ...
A Calculus of Higher Order Safe Ambients and Its Bisimulations
TASE '12: Proceedings of the 2012 Sixth International Symposium on Theoretical Aspects of Software EngineeringIn this paper, we present a higher order ambient calculus HSAP, which is a higher order extension of SAP calculus. In HSAP, we extend higher order communication capability and administrator interaction capability. Higher order communication capability ...
Bisimulation congruences in safe ambients
We study a variant of Levi and Sangiorgi's Safe Ambients (SA) enriched with passwords (SAP). In SAP by managing passwords, for example generating new ones and distributing them selectively, an ambient may now program who may migrate into its computation ...






Comments