Skip to main content
SpringerLink
Log in

Synchronised Hyperedge Replacement as a Model for Service Oriented Computing

  • Conference paper
Formal Methods for Components and Objects (FMCO 2005)

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

Included in the following conference series:

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.

Partially supported by the Project EC FET – Global Computing 2, IST-2005-16004 Sensoria.

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 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. Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint satisfaction and optimization. Journal of the ACM 44(2), 201–236 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Chapter  Google Scholar 

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

    Chapter  Google Scholar 

  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)

    Article  Google Scholar 

  9. Degano, P., Montanari, U.: A model for distributed systems based on graph rewriting. Journal of the ACM 34(2), 411–449 (1987)

    Article  MathSciNet  Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Chapter  Google Scholar 

  12. Fournet, C., Gonthier, G.: The reflexive CHAM and the join-calculus. In: Proc. of POPL 1996, pp. 372–385 (1996)

    Google Scholar 

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

    Chapter  Google Scholar 

  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)

    Chapter  Google Scholar 

  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. Hirsch, D., Tuosto, E.: Coordinating Application Level QoS with SHReQ. Journal of Software and Systems Modelling (submitted, 2006)

    Google Scholar 

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

    Chapter  Google Scholar 

  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. Lanese, I.: Synchronization Strategies for Global Computing Models. PhD thesis, Computer Science Department, University of Pisa, Pisa, Italy (forthcoming, 2006)

    Google Scholar 

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

    Chapter  Google Scholar 

  26. Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1982)

    Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  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. Plotkin, G.D.: A structural approach to operational semantics. J. Log. Algebr. Program. 60-61, 17–139 (2004)

    Article  MathSciNet  Google Scholar 

  30. Riely, J., Hennessy, M.: Distributed processes and location failures. TCS 266(1–2), 693–735 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  31. Rossi, F., Montanari, U.: Graph rewriting, constraint solving and tiles for coordinating distributed systems. Applied Categorical Structures 7(4), 333–370 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  32. Rozenberg, G. (ed.): Handbook of graph grammars and computing by graph transformations. Foundations, vol. 1. World Scientific, Singapore (1997)

    MATH  Google Scholar 

  33. Tuosto, E.: Non-Functional Aspects of Wide Area Network Programming. PhD thesis, Computer Science Department, University of Pisa, Italy (2003)

    Google Scholar 

  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. Winskel, G.: Synchronization trees. TCS 34, 33–82 (1984)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Pisa, Italy

    Gian Luigi Ferrari, Dan Hirsch & Ugo Montanari

  2. Department of Computing, Imperial College, London, UK

    Dan Hirsch

  3. Computer Science Department, University of Bologna, Italy

    Ivan Lanese

  4. Computer Science Department, University of Leicester, UK

    Emilio Tuosto

Authors
  1. Gian Luigi Ferrari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dan Hirsch
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ivan Lanese
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ugo Montanari
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Emilio Tuosto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centre for Mathematics and Computer Science, CWI, Kruislaan 413, 1098, Amsterdam, SJ, The Netherlands

    Frank S. de Boer

  2. Leiden Institute of Advanced Computer Science, Leiden University, P.O. Box 9512, 2300, Leiden, RA, The Netherlands

    Marcello M. Bonsangue

  3. Centre Equitation, VERIMAG, 2 Avenue de Vignate, 38610, Grenoble-Gières, France

    Susanne Graf

  4. Institute of Computer Science and Applied Mathematics, Christian-Albrechts University, Kiel,Hermann-Rodewald-Straße 3, 24118, Kiel, Germany

    Willem-Paul de Roever

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ferrari, G.L., Hirsch, D., Lanese, I., Montanari, U., Tuosto, E. (2006). Synchronised Hyperedge Replacement as a Model for Service Oriented Computing. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, WP. (eds) Formal Methods for Components and Objects. FMCO 2005. Lecture Notes in Computer Science, vol 4111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11804192_2

Download citation

  • DOI: https://doi.org/10.1007/11804192_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-36749-9

  • Online ISBN: 978-3-540-36750-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation