Skip to main content
SpringerLink
Log in

Flexible Interconnection of Graph Transformation Modules

  • Chapter
Formal Methods in Software and Systems Modeling

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3393))

Abstract

Modularization is a well-known concept to structure software systems as well as their specifications. Modules are equipped with export and import interfaces and thus can be connected with other modules requesting or providing certain features.

In this paper, we study modules the interfaces of which consist of behavioral specifications given by typed graph transformation systems. We introduce a framework for classifying and systematically defining relations between typed graph transformation systems. The framework comprises a number of standard ingredients, like homomorphisms between type graphs and mappings between sets of graph transformation rules.

The framework is applied to develop a novel concept of substitution morphism by separating preconditions and effects in the specification of rules. This substitution morphism is suited to define the semantic relation between export and import interfaces of requesting and providing modules.

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. Cherchago, A., Heckel, R.: Specification matching of web services using conditional graph transformation rules. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 304–318. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Corradini, A., Ehrig, H., Löwe, M., Montanari, U., Padberg, J.: The category of typed graph grammars and their adjunction with categories of derivations. In: Cuny, J., Engels, G., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol. 1073, pp. 56–74. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  3. Corradini, A., Montanari, U., Rossi, F.: Graph processes. Fundamenta Informaticae 26(3,4), 241–266 (1996)

    Google Scholar 

  4. Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., Löwe, M.: Algebraic approaches to graph transformation, Part I: Basic concepts and double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation. vol. 1: Foundations, pp. 163–245. World Scientific, Singapore (1997), Preprint available as Tech. Rep. 96/17, Univ. of Pisa, http://www.di.unipi.it/TR/TRengl.html

  5. Ehrig, H., Engels, G.: Pragmatic and semantic aspects of a module concept for graph transformation systems. In: Cuny, J., Engels, G., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol. 1073. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  6. Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.): Handbook of Graph Grammars and Computing by Graph Transformation, vol. 2: Applications, Languages, and Tools. World Scientific, Singapore (1999)

    Google Scholar 

  7. Ehrig, H., Mahr, B.: Fundamentals of algebraic specification 2: module specifications and constraints. Springer, Heidelberg (1990)

    MATH  Google Scholar 

  8. Ehrig, H., Pfender, M., Schneider, H.J.: Graph grammars: an algebraic approach. In: 14th Annual IEEE Symposium on Switching and Automata Theory, pp. 167–180. IEEE, Los Alamitos (1973)

    Chapter  Google Scholar 

  9. Große–Rhode, M., Parisi Presicce, F., Simeoni, M.: Concrete spatial refinement construction for graph transformation systems. Technical Report SI 97/10, Universit‘a di Roma La Sapienza, Dip. Scienze dell’Informazione (1997)

    Google Scholar 

  10. Große-Rhode, M., Simeoni, M., Parisi Presicce, F.: Refinements and modules for typed graph transformation systems. In: Fiadeiro, J.L. (ed.) WADT 1998. LNCS, vol. 1589, pp. 138–151. Springer, Heidelberg (1999)

    Google Scholar 

  11. Große-Rhode, M., Parisi-Presicce, F., Simeoni, M.: Spatial and temporal refinement of typed graph transformation systems. In: Brim, L., Gruska, J., Zlatuška, J. (eds.) MFCS 1998. LNCS, vol. 1450, p. 553. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  12. Große-Rhode, M., Parisi Presicce, F., Simeoni, M.: Refinements and modules for typed graph transformation systems. In: Fiadeiro, J.L. (ed.) WADT 1998. LNCS, vol. 1589, pp. 138–151. Springer, Heidelberg (1999)

    Google Scholar 

  13. Große-Rhode, M., Parisi Presicce, F., Simeoni, M.: Refinements of graph transformation systems via rule expressions. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol. 1764, pp. 368–382. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  14. Habel, A., Heckel, R., Taentzer, G.: Graph grammars with negative application conditions. Fundamenta Informaticae 26(3,4), 287–313 (1996)

    MATH  MathSciNet  Google Scholar 

  15. Hausmann, J.H., Heckel, R., Lohmann, M.: Model-based discovery of web services. In: Proc. International Conference on Web Services, San Diego, USA (July 2004)

    Google Scholar 

  16. Heckel, R.: Open Graph Transformation Systems: A New Approach to the Compositional Modelling of Concurrent and Reactive Systems. PhD thesis, TU Berlin (1998)

    Google Scholar 

  17. Heckel, R., Corradini, A., Ehrig, H., Löwe, M.: Horizontal and vertical structuring of typed graph transformation systems. Math. Struc. in Comp. Science 6(6), 613–648 (1996)

    MATH  Google Scholar 

  18. Heckel, R., Ehrig, H., Wolter, U., Corradini, A.: Double-pullback transitions and coalgebraic loose semantics for graph transformation systems. Applied Categorical Structures 9(1) (January 2001), See also TR 97-07 at http://www.cs.tu-berlin.de/cs/ifb/TechnBerichteListe.html

  19. Heckel, R., Engels, G., Ehrig, H., Taentzer, G.: Classification and comparison of modularity concepts for graph transformation systems. In: Ehrig, et al. (eds.) [6], pp. 669–690

    Google Scholar 

  20. Heckel, R., Engels, G., Ehrig, H., Taentzer, G.: A view-based approach to system modelling based on open graph transformation systems. In: Ehrig et al. (eds.) [6], pp. 639–667

    Google Scholar 

  21. Kreowski, H.-J., Kuske, S.: On the interleaving semantics of transformation units - a step into GRACE. In: Cuny, J., Engels, G., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol. 1073, pp. 89–106. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  22. Meyer, B.: Object-Oriented Software Construction. Prentice Hall International, Englewood Cliffs (1988)

    Google Scholar 

  23. Ribeiro, L.: Parallel Composition and Unfolding Semantics of Graph Grammars. PhD thesis, TU Berlin (1996)

    Google Scholar 

  24. Schürr, A., Winter, A.J.: UML packages for PROgrammed Graph REwrite Systems. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol. 1764, pp. 396–410. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  25. Zaremski, A.M., Wing, J.M.: Signature matching: a tool for using software libraries. ACM Transactions on Software Engineering and Methodology (TOSEM) 4(2), 146–170 (1995)

    Article  Google Scholar 

  26. Zaremski, A.M., Wing, J.M.: Specification matching of software components. In: Proc. SIGSOFT 1995 Third ACM SIGSOFT Symposium on the Foundations of Software Engineering. vol. 20(4), ACM SIGSOFT Software Engineering Notes, October 1995, pp. 6–17. Also CMU-CS-95-127 (March 1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Paderborn, Germany

    Gregor Engels, Reiko Heckel & Alexey Cherchago

Authors
  1. Gregor Engels
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Reiko Heckel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alexey Cherchago
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Bremen, P.O. Box 33 04 40, 28334, Bremen, Germany

    Hans-Jörg Kreowski

  2. Dipartimento di Informatica, Università di Pisa,  

    Ugo Montanari

  3. Dpto de L.S.I., Universitat Politècnica de Catalunya, Campus Nord, Mòdul Omega, Jordi Girona 1-3, 08034, Barcelona, Spain

    Fernando Orejas

  4. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

  5. Philipps-Universität Marburg, Germany

    Gabriele Taentzer

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Engels, G., Heckel, R., Cherchago, A. (2005). Flexible Interconnection of Graph Transformation Modules. In: Kreowski, HJ., Montanari, U., Orejas, F., Rozenberg, G., Taentzer, G. (eds) Formal Methods in Software and Systems Modeling. Lecture Notes in Computer Science, vol 3393. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31847-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31847-7_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24936-8

  • Online ISBN: 978-3-540-31847-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation