Skip to main content
SpringerLink
Log in

A Calculus of Mobile Resources*

  • Conference paper
  • First Online:
CONCUR 2002 — Concurrency Theory (CONCUR 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2421))

Included in the following conference series:

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.

The third author is supported by ‘MyThS: Models and Types for Security in Mobile Distributed Systems’,EU FET-GC IST-2001-32617.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Martin Abadi and Cédric Fournet. Mobile values, new names, and secure communication. In Proceedings of POPL’01. ACM, January 2001.

    Google Scholar 

  2. ACM. 27th Annual Symposium an Principles of Programming Languages (POPL) (Boston, MA), January 2000.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. 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.

    Google Scholar 

  6. Luca Cardelli and Andrew D. Gordon. Types for mobile ambients. In Proceedings of POPL’99, pages 79–92. ACM,1999. 286

    Google Scholar 

  7. Luca Cardelli and Andrew D. Gordon. Anytime, anywhere: Modal logics for mobile ambients. In Proceedings of POPL’00 [2], pages 365–377.

    Google Scholar 

  8. William Ferreira, Matthew Hennessy, and Alan Jeffrey. A theory of weak bisimulation for core CML. Journal of Functional Programming, 8(5):447–491, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  9. Cédric Fournet and Georges Gonthier. A hierarchy of equivalences for asynchronous calculi. In Larsen et al. [14], pages 844–855.

    Google Scholar 

  10. 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.

    Google Scholar 

  11. Jens Chr. Godskesen, Thomas Hildebrandt, and Vladimiro Sassone. A calculus of mobile resources. Technical Report TR-2002-16, The IT University of Copenhagen, 2002.

    Google Scholar 

  12. Uwe Hansmann, Martin S. Nicklous, Thomas Schäck, and Frank Seliger. Smart Card Application Development Using Java. Springer, 200.

    Google Scholar 

  13. 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.

    Google Scholar 

  14. 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.

    Google Scholar 

  15. 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.

    Google Scholar 

  16. Francesca Levi and Davide Sangiorgi. Controlling interference in ambients. In Proceedings of POPL’00 [2], pages 352–364.

    Google Scholar 

  17. Massimo Merro and Matthew Hennessy. Bisimulation congruences in safe ambients. ACM SIGPLAN Notices, 31( 1):71–80, January 2002.

    Article  Google Scholar 

  18. Robin Milner. Communicating und Mobile Systems: the π-Culculus. Cambridge University Press, May 1999.

    Google Scholar 

  19. Davide Sangiorgi. Bisimulation for Higher-Order Process Calculi. Information and Computation, 131(2):141–178, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  20. Davide Sangiorgi and David Walker. The pi-calculus: a Theory of Mobile Processes. Cambridge Universtity Press, 2001.

    Google Scholar 

  21. 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.

    Google Scholar 

  22. Peter Sewell. Global/local subtyping and capability inference for a distributed pi-calculus. In Larsen et al. [14], pages 695–706.

    Google Scholar 

  23. Jan Vitek and Giuseppe Castagna. Seal: A framework for secure mobile computations. In Internet Progrnmming Lunguuaes, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IT University of Copenhagen, Copenhagen

    Jens Chr. Godskesen & Thomas Hildebrandt

  2. University of Sussex, Sussex

    Vladimiro Sassone

Authors
  1. Jens Chr. Godskesen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Hildebrandt
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vladimiro Sassone
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Informatics, Masaryk University Brno, Botanicka 68a, 60200, Brno, Czech Republic

    Luboš Brim , Mojmír Křetínský  & Antonín Kučera ,  & 

  2. Faculty of Electrical Engineering and Informatics, Department of Computer Science, Technical University of Ostrava (VSB), 17. listopadu 15, 70833, Ostrava-Poruba, Czech Republic

    Petr Jančar

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation