Skip to main content

A Generic Membrane Model (Note)

  • Conference paper
Global Computing (GC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3267))

Included in the following conference series:

Abstract

In this note we introduce a generic model for controlling migration in a network of distributed processes. To this end, we equip the membrane of a domain containing processes with some computing power, including in particular some specific primitives to manage the movements of entities from the inside to the outside of a domain, and conversely. We define a π-calculus instance of our model, and illustrate by means of examples its expressive power. We also discuss a possible extension of our migration model to the case of hierarchically organized domains.

Work supported by the MIKADO project of the IST-FET Global ComputingInitiative.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Amadio, R.: An asynchronous model of locality, failure, and process mobility. In: Garlan, D., Le Métayer, D. (eds.) COORDINATION 1997. LNCS, vol. 1282, Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  2. Berry, G., Boudol, G.: The chemical abstract machine. Theoretical Comput. Sci. 96, 217–248 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  3. Boudol, G.: Asynchrony and the π-calculus, INRIA Res. Report 1702 (1992)

    Google Scholar 

  4. Boudol, G., Castellani, I., Hennessy, M., Kiehn, A.: Observing localities. Theoretical Comput. Sci. 114, 31–61 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bugliesi, M., Castagna, G., Crafa, S.: Access control for mobile agents: the calculus of Boxed Ambients. ACM TOPLAS 26(1), 57–124 (2004)

    Article  Google Scholar 

  6. Cardelli, L.: A language with distributed scope. Computing Systems 8(1), 27–59 (1995)

    Google Scholar 

  7. Cardelli, L., Ghelli, G., Gordon, A.: 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)

    Chapter  Google Scholar 

  8. Cardelli, L., Gordon, A.: Mobile Ambients. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, pp. 140–155. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  9. Castellani, I.: Process Algebras with Localities. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebras, vol. 15, pp. 945–1045. Elsevier, Amsterdam (2001)

    Chapter  Google Scholar 

  10. De Nicola, R., Ferrari, G., Pugliese, R.: KLAIM: a kernel langage for agents interaction and mobility. IEEE Trans. on Software Engineering 24(5), 315–330 (1998)

    Article  Google Scholar 

  11. Fournet, C., Gonthier, G., Lévy, J.-J., Maranget, L., R´emy, D.: A calculus of mobile agents. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996, vol. 1119, pp. 406–421. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  12. Fuggetta, A., Picco, G.P., Vigna, G.: Understanding code mobility. IEEE Trans. on Soft. Eng. 24(5), 342–361 (1998)

    Article  Google Scholar 

  13. Hennessy, M., Rathke, J., Yoshida, N.: SafeDpi: a language for controlling mobile code, Comput. Sci. Tech. Rep. 02, University of Sussex (2003)

    Google Scholar 

  14. Hennessy, M., Riely, J.: Resource access control in systems of mobile agents. Information and Computation 173, 82–120 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  15. Honda, K., Tokoro, M.: An object calculus for asynchronous communication. In: America, P. (ed.) ECOOP 1991. LNCS, vol. 512, pp. 133–147. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  16. Levi, F., Sangiorgi, D.: Controlling interference in Ambients. In: POPL 2000, pp. 352–364 (2000)

    Google Scholar 

  17. Milner, R.: Functions as processes. Math. Struct. in Comp. Science 2, 119–141 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  18. Milner, R.: The polyadic π-calculus: a tutorial, Technical Report ECS-LFCS-91- 180, Edinburgh University (1991); Reprinted in Bauer, F., Brauer, W., Schwichtenberg, H. (eds.): Logic and Algebra of Specification, pp. 203–246. Springer, Heidelberg (1993)

    Google Scholar 

  19. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. Information and Computation 100, 1–77 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  20. Ravara, A., Matos, A., Vasconcelos, V., Lopes, L.: Lexically scoping distribution: what you see is what you get. In: Foundations of Global Computing Workshop. ENTCS, vol. 85 (2003)

    Google Scholar 

  21. Stefani, J.-B.: A calculus of kells. In: Foundations of Global Computing Workshop. Electronic Notes in Comput. Sci, vol. 85 (2003)

    Google Scholar 

  22. Schmitt, A., Stefani, J.-B.: The M-calculus: a higher-order distributed process calculus. In: POPL 2003, pp. 50-61 (2003)

    Google Scholar 

  23. Sewell, P., Wojciechowski, P.: Nomadic Pict: language and infrastructure design for mobile agents. IEEE Concurrency 8(2), 42–52 (2000)

    Article  Google Scholar 

  24. Vitek, J., Castagna, G.: Seal: a framework for secure mobile computations. In: Bal, H.E., Cardelli, L., Belkhouche, B. (eds.) ICCL-WS 1998. LNCS, vol. 1686, pp. 47–77. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boudol, G. (2005). A Generic Membrane Model (Note). In: Priami, C., Quaglia, P. (eds) Global Computing. GC 2004. Lecture Notes in Computer Science, vol 3267. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31794-4_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31794-4_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24101-0

  • Online ISBN: 978-3-540-31794-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics