Advertisement

Synchronised Hyperedge Replacement as a Model for Service Oriented Computing

  • Gian Luigi Ferrari
  • Dan Hirsch
  • Ivan Lanese
  • Ugo Montanari
  • Emilio Tuosto
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4111)

Abstract

This tutorial paper describes a framework for modelling several aspects of distributed computing based on Synchronised Hyperedge Replacement (SHR), a graph rewriting formalism. Components are represented as edges and they rewrite themselves by synchronising with neighbour components the productions that specify their behaviour. The SHR framework has been equipped with many formal devices for representing complex synchronisation mechanisms which can tackle mobility, heterogeneous synchronisations and non-functional aspects, key factors of Service Oriented Computing (SOC). We revise the SHR family as a suitable model for contributing to the formalisation of SOC systems.

Keywords

Inference Rule Computer Science Department Graph Grammar Free Node Service Orient Computing 
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.
    Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint satisfaction and optimization. Journal of the ACM 44(2), 201–236 (1997)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Cardelli, L., Gordon, A.D.: Mobile ambients. In: Nivat, M. (ed.) ETAPS 1998 and FOSSACS 1998. LNCS, vol. 1378, pp. 140–155. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  3. 3.
    Castellani, I., Montanari, U.: Graph grammars for distributed systems. In: Ehrig, H., Nagl, M., Rozenberg, G. (eds.) Graph Grammars 1982. LNCS, vol. 153, pp. 20–38. Springer, Heidelberg (1983)CrossRefGoogle Scholar
  4. 4.
    Corradini, A., Degano, P., Montanari, U.: Specifying highly concurrent data structure manipulation. In: Proc. of Computing 1985. Elsevier Science, Amsterdam (1985)Google Scholar
  5. 5.
    Corradini, A., Hirsch, D.: An operational semantics of CommUnity based on graph transformation systems. In: Proc. of GT-VMT 2004. Elect. Notes in Th. Comput. Sci., vol. 109, pp. 111–124. Elsevier Science, Amsterdam (2004)Google Scholar
  6. 6.
    De Nicola, R., Ferrari, G., Montanari, U., Pugliese, R., Tuosto, E.: A Formal Basis for Reasoning on Programmable QoS. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol. 2772, pp. 436–479. Springer, Heidelberg (2004)Google Scholar
  7. 7.
    De Nicola, R., Ferrari, G., Montanari, U., Pugliese, R., Tuosto, E.: A process calculus for qos-aware applications. In: Jacquet, J.-M., Picco, G.P. (eds.) COORDINATION 2005. LNCS, vol. 3454, pp. 33–48. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. 8.
    De Nicola, R., Ferrari, G., Pugliese, R.: KLAIM: A kernel language for agents interaction and mobility. IEEE Trans. Software Eng. 24(5), 315–330 (1998)CrossRefGoogle Scholar
  9. 9.
    Degano, P., Montanari, U.: A model for distributed systems based on graph rewriting. Journal of the ACM 34(2), 411–449 (1987)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Ferrari, G., Montanari, U., Tuosto, E.: A LTS semantics of ambients via graph synchronization with mobility. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol. 2202, pp. 1–16. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  11. 11.
    Ferrari, G., Montanari, U., Tuosto, E.: Graph-based models of internetworking systems. In: Aichernig, B.K., Maibaum, T.S.E. (eds.) Formal Methods at the Crossroads. From Panacea to Foundational Support. LNCS, vol. 2757, pp. 242–266. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  12. 12.
    Fournet, C., Gonthier, G.: The reflexive CHAM and the join-calculus. In: Proc. of POPL 1996, pp. 372–385 (1996)Google Scholar
  13. 13.
    Gadducci, F., Montanari, U.: The tile model. In: Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, Cambridge (2000)Google Scholar
  14. 14.
    Hirsch, D.: Graph Transformation Models for Software Architecture Styles. PhD thesis, Departamento de Computación, Facultad de Ciencias Exactas y Naturales, U.B.A (2003)Google Scholar
  15. 15.
    Hirsch, D., Inverardi, P., Montanari, U.: Reconfiguration of software architecture styles with name mobility. In: Porto, A., Roman, G.-C. (eds.) COORDINATION 2000. LNCS, vol. 1906, pp. 148–163. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  16. 16.
    Hirsch, D., Montanari, U.: Synchronized hyperedge replacement with name mobility. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, p. 121. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  17. 17.
    Hirsch, D., Tuosto, E.: SHReQ: A framework for coordinating application level QoS. In: Proc. of SEFM 2005, pp. 425–434. IEEE Computer Society Press, Los Alamitos (2005)Google Scholar
  18. 18.
    Hirsch, D., Tuosto, E.: Coordinating Application Level QoS with SHReQ. Journal of Software and Systems Modelling (submitted, 2006)Google Scholar
  19. 19.
    Hoare, C.A.R.: A model for communicating sequential processes. In: On the Construction of Programs. Cambridge University Press, Cambridge (1980)Google Scholar
  20. 20.
    König, B., Montanari, U.: Observational equivalence for synchronized graph rewriting. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol. 2215, pp. 145–164. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  21. 21.
    Lanese, I.: Exploiting user-definable synchronizations in graph transformation. In: Proc. of GT-VMT 2006. Elect. Notes in Th. Comput. Sci. Elsevier Science, Amsterdam (to appear, 2006)Google Scholar
  22. 22.
    Lanese, I.: Synchronization Strategies for Global Computing Models. PhD thesis, Computer Science Department, University of Pisa, Pisa, Italy (forthcoming, 2006)Google Scholar
  23. 23.
    Lanese, I., Montanari, U.: A graphical fusion calculus. In: Proceedings of the Workshop of the COMETA Project on Computational Metamodels. Elect. Notes in Th. Comput. Sci., vol. 104, pp. 199–215. Elsevier Science, Amsterdam (2004)Google Scholar
  24. 24.
    Lanese, I., Montanari, U.: Synchronization algebras with mobility for graph transformations. In: Proc. of FGUC 2004 – Foundations of Global Ubiquitous Computing. Elect. Notes in Th. Comput. Sci., vol. 138, pp. 43–60. Elsevier Science, Amsterdam (2004)Google Scholar
  25. 25.
    Lanese, I., Tuosto, E.: Synchronized hyperedge replacement for heterogeneous systems. In: Jacquet, J.-M., Picco, G.P. (eds.) COORDINATION 2005. LNCS, vol. 3454, pp. 220–235. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  26. 26.
    Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1982)Google Scholar
  27. 27.
    Milner, R., Parrow, J., Walker, J.: A calculus of mobile processes, I and II. Inform. and Comput. 100(1), 1–40, 41–77 (1992)MATHCrossRefMathSciNetGoogle Scholar
  28. 28.
    Parrow, J., Victor, B.: The fusion calculus: Expressiveness and symmetry in mobile processes. In: Proc. of LICS 1998, pp. 176–185. IEEE Computer Society Press, Los Alamitos (1998)Google Scholar
  29. 29.
    Plotkin, G.D.: A structural approach to operational semantics. J. Log. Algebr. Program. 60-61, 17–139 (2004)CrossRefMathSciNetGoogle Scholar
  30. 30.
    Riely, J., Hennessy, M.: Distributed processes and location failures. TCS 266(1–2), 693–735 (2001)MATHCrossRefMathSciNetGoogle Scholar
  31. 31.
    Rossi, F., Montanari, U.: Graph rewriting, constraint solving and tiles for coordinating distributed systems. Applied Categorical Structures 7(4), 333–370 (1999)MATHCrossRefMathSciNetGoogle Scholar
  32. 32.
    Rozenberg, G. (ed.): Handbook of graph grammars and computing by graph transformations. Foundations, vol. 1. World Scientific, Singapore (1997)MATHGoogle Scholar
  33. 33.
    Tuosto, E.: Non-Functional Aspects of Wide Area Network Programming. PhD thesis, Computer Science Department, University of Pisa, Italy (2003)Google Scholar
  34. 34.
    van der Aalst, W.M.P., Lassen, K.B.: Translating workflow nets to BPEL4WS. Technical Report WP 145, Eindhoven University of Technology (2005)Google Scholar
  35. 35.
    Winskel, G.: Synchronization trees. TCS 34, 33–82 (1984)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Gian Luigi Ferrari
    • 1
  • Dan Hirsch
    • 1
    • 2
  • Ivan Lanese
    • 3
  • Ugo Montanari
    • 1
  • Emilio Tuosto
    • 4
  1. 1.Computer Science DepartmentUniversity of PisaItaly
  2. 2.Department of ComputingImperial CollegeLondonUK
  3. 3.Computer Science DepartmentUniversity of BolognaItaly
  4. 4.Computer Science DepartmentUniversity of LeicesterUK

Personalised recommendations