Advertisement

Making Components Move: A Separation of Concerns Approach

  • Dirk Pattinson
  • Martin Wirsing
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2852)

Abstract

We present a new calculus for mobile systems, the main feature of which is the separation between dynamic and topological aspects of distributed computations. Our calculus realises the following basic assumptions: (1) every computation executes in a uniquely determined location (2) processes modify the distributed structure by means of predefined operations, and (3) the underlying programming language can be changed easily. This paper introduces our calculus, and shows, that this separation of concerns leads to a perfect match between the logical, syntactical and algebraic theory. On the methodological side, we demonstrate by means of two examples, that the strict distinction between topological and computational aspects allows for an easy integration of features, which are missing in other calculi.

Keywords

Operational Semantic Algebraic Theory Label Transition System Mobile Process Spatial Congruence 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Arbab, F.: Abstract behaviour types: A foundation model for components and their composition. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2002. LNCS, vol. 2852, pp. 33–70. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  2. 2.
    Caires, L., Cardelli, L.: A spatial logic for concurrency (part i). In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol. 2215, pp. 1–37. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  3. 3.
    Caires, L., Cardelli, L.: A spatial logic for concurrency (part i). In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, p. 209. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  4. 4.
    Cardelli, L., Gordon, A.: Anytime, anywhere: Modal logics for mobile ambients. In: Proc. POPL 2000, pp. 365–377. ACM, New York (2000)Google Scholar
  5. 5.
    Cardelli, L., Gordon, A.: Mobile ambients. Theor. Comp. Sci. 240(1), 177–213 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Gabbay, D., Pitts, A.: A new approach to abstract syntax involving binders. In: 14th IEEE Symposium on Logic in Computer Science (LICS 1999), pp. 214–224. IEEE Computer Society, Los Alamitos (1999)Google Scholar
  7. 7.
    Hennessy, M., Milner, R.: Algebraic Laws for Non-determinism and Concurrency. Journal of the ACM 32, 137–161 (1985)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Milner, R.: Communicating and Mobile Systems: the π-Calculus. Cambridge University Press, Cambridge (1999)Google Scholar
  9. 9.
    Montanari, U., Sassone, V.: Dynamic congruence vs. progressing bisimulation for CCS. Fundamenta Informaticae 16(2), 171–199 (1992)zbMATHMathSciNetGoogle Scholar
  10. 10.
    De Nicola, R., Ferrari, G., Pugliese, R.: Klaim: a kernel language for agents interaction and mobility. IEEE Trans. Software Engineering 24(5), 315–330 (1998)CrossRefGoogle Scholar
  11. 11.
    Nierstrasz, O., Achermann, F.: A calculus for modelling software components. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2002. LNCS, vol. 2852, pp. 339–360. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  12. 12.
    Parrow, J., Victor, B.: The fusion calculus: Expressiveness and symmetry in mobile processes. In: Thirteenth Annual Symposium on Logic in Computer Science (LICS 1998), pp. 176–185. IEEE, IEEE Computer Society, Los Alamitos (1998)CrossRefGoogle Scholar
  13. 13.
    Sangiorgi, D.: From π-calculus to Higher-Order π-calculus — and back. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) CAAP 1993, FASE 1993, and TAPSOFT 1993. LNCS, vol. 668, pp. 151–166. Springer, Heidelberg (1993)Google Scholar
  14. 14.
    Sangiorgi, D.: Extensionality and intensionality of the ambient logics. In: Proc. POPL 2001, pp. 4–13. ACM, New York (2001)Google Scholar
  15. 15.
    Sangiorgi, D.: Separability, expressiveness, and decidability in the ambient logic. In: 17th IEEE Symposium on Logic in Computer Science (LICS 2002). IEEE Computer Society, Los Alamitos (2002)Google Scholar
  16. 16.
    Sangiorgi, D., Walker, D.: The π-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)Google Scholar
  17. 17.
    Vitek, J., Castagna, G.: Seal: A framework for secure mobile computation. Internet Programming (1999)Google Scholar
  18. 18.
    Wojciechowski, P., Sewell, P.: Nomadic pict: Language and infrastructure design for mobile agents. IEEE Concurrency 8(2), 42–52 (2000)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Dirk Pattinson
    • 1
  • Martin Wirsing
    • 1
  1. 1.Institut für InformatikLMU München

Personalised recommendations