Skip to main content

A Component Concept for Typed Graphs with Inheritance and Containment Structures

  • Conference paper

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

Abstract

Model-driven development (MDD) has become a promising trend in software engineering. The model-driven development of highly complex software systems may lead to large models which deserve a modularization concept to enable their structured development in larger teams. Graphs are a natural way to represent the underlying structure of visual models. Typed graphs with inheritance and containment are well suited to describe the essentials of models based on the Eclipse Modeling Framework (EMF). EMF models already support the physical distribution of model parts. Based on the concept of distributed graphs, we propose typed composite graphs with inheritance and containment to specify logical distribution structures of EMF models. The category-theoretical foundation of this kind of composite graphs forms a solid basis for the precise definition of typed composite graph transformations obeying inheritance and containment conditions.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jurack, S., Taentzer, G.: Towards Composite Model Transformations Using Distributed Graph Transformation Concepts. In: Schürr, A., Selic, B. (eds.) MODELS 2009. LNCS, vol. 5795, pp. 226–240. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  2. EMF: Eclipse Modeling Framework (2010), http://www.eclipse.com/emf

  3. Steinberg, D., Budinsky, F., Patenostro, M., Merks, E.: EMF: Eclipse Modeling Framework, 2nd edn. Addison Wesley, Reading (2008)

    Google Scholar 

  4. OMG: Meta Object Facilities 2.0 Specification (2010), http://www.omg.org/spec/MOF/2.0/

  5. Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. In: Monographs in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2006)

    Google Scholar 

  6. Biermann, E., Ermel, C., Taentzer, G.: Precise Semantics of EMF Model Transformations by Graph Transformation. In: Czarnecki, K., Ober, I., Bruel, J.-M., Uhl, A., Völter, M. (eds.) MODELS 2008. LNCS, vol. 5301, pp. 53–67. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  7. Jurack, S., Taentzer, G.: A Component Concept for Typed Graphs with Inheritance and Containment Structures: Long Version. Technical report, Philipps-Universität Marburg (2010), http://www.uni-marburg.de/fb12/forschung/berichte/berichteinformtk/pdfbi/bi2010-1.pdf

  8. Ehrig, H., Orejas, F., Prange, U.: Categorical Foundations of Distributed Graph Transformation. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 215–229. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Taentzer, G.: Parallel and Distributed Graph Transformation: Formal Description and Application to Communication Based Systems. PhD thesis, Technical University of Berlin (1996)

    Google Scholar 

  10. Ehrig, H., Heckel, R., Korff, M., Löwe, M., Ribeiro, L., Wagner, A., Corradini, A.: Algebraic Approaches to Graph Transformation - Part II: Single Pushout Approach and Comparison with Double Pushout Approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformations. Foundations, vol. 1, pp. 247–312. World Scientific, Singapore (1997)

    Chapter  Google Scholar 

  11. Ranger, U., Lüstraeten, M.: Search Trees for Distributed Graph Transformation Systems. In: Electronic Communication of the EASST, vol. 4 (2006)

    Google Scholar 

  12. Mezei, G., Juhasz, S., Levendovsky, T.: A distribution technique for graph rewriting and model transformation systems. In: Burkhart, H. (ed.) Proc. of the IASTED Int. Conference on Parallel and Distributed Computing Networks. IASTED/ACTA Press (2007)

    Google Scholar 

  13. Goedicke, M., Meyer, T., Taentzer, G.: ViewPoint-oriented Software Development by Distributed Graph Transformation: Towards a Basis for Living with Inconsistencies. In: Proc. 4th IEEE Int. Symposium on Requirements Engineering (RE 1999), University of Limerick, Ireland, June 7-11. IEEE Computer Society, Los Alamitos (1999), ISBN 0-7695-0188-5

    Google Scholar 

  14. Heidenreich, F., Henriksson, J., Johannes, J., Zschaler, S.: On Language-Independent Model Modularisation. In: T. Aspect-Oriented Software Development VI, pp. 39–82 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jurack, S., Taentzer, G. (2010). A Component Concept for Typed Graphs with Inheritance and Containment Structures. In: Ehrig, H., Rensink, A., Rozenberg, G., Schürr, A. (eds) Graph Transformations. ICGT 2010. Lecture Notes in Computer Science, vol 6372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15928-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15928-2_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15927-5

  • Online ISBN: 978-3-642-15928-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics