Abstract
We introduce a calculus of Mobile Resources (MR) tailored for the design and analysis of systems containing mobile, possibly nested, computing devices that may have resource and access constraints,an d which are not copyable nor modifiable per se. We provide a reduction as well as a labelled transition semantics and prove a correspondence between barbed bisimulation congruence and a higher-order bisimulation. We provide examples of the expressiveness of the calculus, and apply the theory to prove one of its characteristic properties.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
The third author is supported by ‘MyThS: Models and Types for Security in Mobile Distributed Systems’,EU FET-GC IST-2001-32617.
References
Martin Abadi and Cédric Fournet. Mobile values, new names, and secure communication. In Proceedings of POPL’01. ACM, January 2001.
ACM. 27th Annual Symposium an Principles of Programming Languages (POPL) (Boston, MA), January 2000.
Michele Bugliesi, Giuseppe Castagna, and Silvia Crafa. Boxed ambients. In Benjamin Pierce, editor, TACS’01, volume 2215 of Lecture Notes in Computer Science, pages 38–63. Springer-Verlag, 2001.
Luca Cardelli, Giorgio Ghelli, and Andrew D. Gordon.Ambient groups and mobility types. In J. van Leeuwen, O. Watanabe, M. Hagiya, P. D. Mosses, and T. Ito, editors, Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics, Proceedings of the International IFIP Conference TCS 2000 (Sendai, Japan), volume 1872 of LNCS, pages 333–347. IFIP, Springer, August 2000.
Luca Cardelli and Andrew D. Gordon. Mobile ambients. In Maurice Nivat, editor, Proceedings of FoSSaCS’98, volume 1378 of LNCS, pages 140–155. Springer,1998.
Luca Cardelli and Andrew D. Gordon. Types for mobile ambients. In Proceedings of POPL’99, pages 79–92. ACM,1999. 286
Luca Cardelli and Andrew D. Gordon. Anytime, anywhere: Modal logics for mobile ambients. In Proceedings of POPL’00 [2], pages 365–377.
William Ferreira, Matthew Hennessy, and Alan Jeffrey. A theory of weak bisimulation for core CML. Journal of Functional Programming, 8(5):447–491, 1998.
Cédric Fournet and Georges Gonthier. A hierarchy of equivalences for asynchronous calculi. In Larsen et al. [14], pages 844–855.
Cédric Fournet, Georges Gonthier, Jean-Jacques Levy, Luc Maranget, and Didier Remy. A calculus of mobile agents. In Ugo Montanari and Vladimiro Sassone, editors, Proceedings of CONCUR’96, volume 1119 of LNCS, pages 406–421. Springer, 1996.
Jens Chr. Godskesen, Thomas Hildebrandt, and Vladimiro Sassone. A calculus of mobile resources. Technical Report TR-2002-16, The IT University of Copenhagen, 2002.
Uwe Hansmann, Martin S. Nicklous, Thomas Schäck, and Frank Seliger. Smart Card Application Development Using Java. Springer, 200.
Matthew Hennessy and James Riely. Resource access control in systems of mobile agents. In Uwe Nestmann and Benjamin C. Pierce, editors, Proceedings of HLCL’98, volume 16.3 of ENTCS, pages 3–17. Elsevier Science Publishers, 1998.
Kim G. Larsen, Sven Skyum, and Glynn Winskel, editors. 25th Colloquium an Automutu, Lunguages und Progrnmming (ICALP) (Aalborg, Denmark), volume 1443 of LNCS. Springer, July 1998.
James J. Leifer and Robin Milner. Deriving bisimulation congruences for reactive systems. In Proceedings of CONCUR 2000, volume 1877 of LNCS, pages 243–258, 2000.
Francesca Levi and Davide Sangiorgi. Controlling interference in ambients. In Proceedings of POPL’00 [2], pages 352–364.
Massimo Merro and Matthew Hennessy. Bisimulation congruences in safe ambients. ACM SIGPLAN Notices, 31( 1):71–80, January 2002.
Robin Milner. Communicating und Mobile Systems: the π-Culculus. Cambridge University Press, May 1999.
Davide Sangiorgi. Bisimulation for Higher-Order Process Calculi. Information and Computation, 131(2):141–178, 1996.
Davide Sangiorgi and David Walker. The pi-calculus: a Theory of Mobile Processes. Cambridge Universtity Press, 2001.
Peter Sewell. From rewrite rules to bisimulation congruences. In D. Sangiorgi and R. de Simone, editors, Proceedings CONCUR’98, volume 1466, pages 269–284, 1998.
Peter Sewell. Global/local subtyping and capability inference for a distributed pi-calculus. In Larsen et al. [14], pages 695–706.
Jan Vitek and Giuseppe Castagna. Seal: A framework for secure mobile computations. In Internet Progrnmming Lunguuaes, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Godskesen, J.C., Hildebrandt, T., Sassone, V. (2002). A Calculus of Mobile Resources* . In: Brim, L., Křetínský, M., Kučera, A., Jančar, P. (eds) CONCUR 2002 — Concurrency Theory. CONCUR 2002. Lecture Notes in Computer Science, vol 2421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45694-5_19
Download citation
DOI: https://doi.org/10.1007/3-540-45694-5_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44043-7
Online ISBN: 978-3-540-45694-0
eBook Packages: Springer Book Archive