Advertisement

Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems

(Extended Abstract)
  • Matthew Hennessy
  • Massimo Merro
  • Julian Rathke
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2620)

Abstract

We define a typed bisimulation equivalence for the language Dpi, a distributed version of the π-calculus in which processes may migrate between dynamically created locations. It takes into account resource access policies, which can be implemented in Dpi using a novel form of dynamic capability types. The equivalence, based on typed actions between configurations, is justified by showing that it is fullyabstract with respect to a natural distributed version of a contextual equivalence.

In the second part of the paper we study the effect of controlling the migration of processes. This affects the ability to perform observations at specific locations, as the observer may be denied access. We show how the typed actions can be modified to take this into account, and generalise the full-abstraction result to this more delicate scenario.

Keywords

Mobile Agent Behavioural Theory Label Transition System Type Environment Mobile Process 
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.

References

  1. 1.
    Roberto M. Amadio and Sanjiva Prasad. Modelling IP mobility. In Davide Sangiorgi and Robert de Simone, editors, CONCUR’ 98: Concurrency Theory (9th International Conference, Nice, France), volume 1466 of LNCS, pages 301–316. Springer, September 1998.Google Scholar
  2. 2.
    M. Boreale and D. Sangiorgi. Bisimulation in name-passing calculi without matching. In 13th LICS Conf. IEEE Computer Society Press, 1998.Google Scholar
  3. 3.
    Luca Cardelli. A language with distributed scope. Computing Systems, 8(1):27–59, 1995. Short version in Proceedings of POPL’ 95. A preliminary version appeared as Report 122, Digital Systems Research, June 1994.Google Scholar
  4. 4.
    Luca Cardelli and Andrew D. Gordon. Mobile ambients. Theoretical Computer Science, 240(1):177–213, June 2000.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    G. Castagna and F. Zappa. The seal calculus revisited. In 22th Conference on the Foundations of Software Technology and Theoretical Computer Science. Springer-Verlag, 2002.Google Scholar
  6. 6.
    Cédric Fournet, Georges Gonthier, Jean-Jacques Lévy, Luc Maranget, and Didier Rémy. A calculus of mobile agents. In 7th International Conference on Concurrency Theory (CONCUR’96), pages 406–421, Pisa, Italy, August 26-29 1996. Springer-Verlag. LNCS 1119.Google Scholar
  7. 7.
    M. Hennessy, M. Merro, and J. Rathke. Towards a behavioural theory of access and mobility control in distributed systems. Computer Science Report 2002:01, University of Sussex, 2002.Google Scholar
  8. 8.
    M. Hennessy and J. Rathke. Typed behavioural equivalences for processes in the presence of subtyping. In Proc. CATS2002, Computing: Australasian Theory Symposium, Melbourne 2002, 2002. Also available as a University of Sussex technical report.Google Scholar
  9. 9.
    M. Hennessy and J. Riely. Resource access control in systems of mobile agents. Information and Computation, 173:82–120, 2002.zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    M. Merro and M. Hennessy. Bisimulation congruences in safe ambients. ACM SIGPLAN Notices, 31(1):71–80, January 2002.CrossRefGoogle Scholar
  11. 11.
    M. Merro, J. Kleist, and U. Nestmann. Mobile Objects as Mobile Processes. To appear in Journal of Information and Computation, 2002.Google Scholar
  12. 12.
    R. Milner. Communication and Concurrency. Prentice Hall, 1989.Google Scholar
  13. 13.
    R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, (Parts I and II). Information and Computation, 100:1–77, 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Peter Sewell. Global/local subtyping and capability inference for a distributed pi-calculus. In ICALP 98, volume 1443 of LNCS. Springer, 1998.Google Scholar
  15. 15.
    Asis Unyapoth and Peter Sewell. Nomadic pict: Correct communication infrastructure for mobile computation. In Conference Record of POPL’01: The 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 236–247, London, United Kingdom, January 17-19, 2001.Google Scholar
  16. 16.
    J. Vitek and G. Castagna. A calculus of secure mobile computations. In Secure Internet Programming: Security Issues for Distributed and Mobile Objects, volume 1603 of LNCS. Springer, 1999.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Matthew Hennessy
    • 1
  • Massimo Merro
    • 2
  • Julian Rathke
    • 1
  1. 1.School of Cognitive and Computing SciencesUniversity of SussexSussex
  2. 2.Dipartimento di InformaticaUniversitá di VeronaVerona

Personalised recommendations