Skip to main content

Towards Local Confluence Analysis for Amalgamated Graph Transformation

  • Conference paper
  • First Online:
Graph Transformation (ICGT 2015)

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

Included in the following conference series:

Abstract

Amalgamated graph transformation allows to define schemes of rules coinciding in common core activities and differing over additional parallel independent activities. Consequently, a rule scheme is specified by a kernel rule and a set of extending multi-rules forming an interaction scheme. Amalgamated transformations have been increasingly used in various modeling contexts.

Critical Pair Analysis (CPA) can be used to show local confluence of graph transformation systems. It is an open challenge to lift the CPA to amalgamated graph transformation systems, especially since infinite many pairs of amalgamated rules occur in general. As a first step towards an efficient local confluence analysis of amalgamated graph transformation systems, we show that the analysis of a finite set of critical pairs suffices to prove local confluence.

This work is partly supported by a Humboldt Post-Doc Fellowship as part of the Excellence Initiative by the German federal and state governments.

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

Access this chapter

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 EPUB and 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

References

  1. The Fujaba tool suite. www.fujaba.de

  2. Biermann, E., Ehrig, H., Ermel, C., Golas, U., Taentzer, G.: Parallel independence of amalgamated graph transformations applied to model transformation. In: Engels, G., Lewerentz, C., Schäfer, W., Schürr, A., Westfechtel, B. (eds.) Nagl Festschrift. LNCS, vol. 5765, pp. 121–140. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  3. Biermann, E., Ermel, C., Taentzer, G.: Lifting parallel graph transformation concepts to model transformation based on the eclipse modeling framework. ECEASST 26, 19 (2010)

    Google Scholar 

  4. Biermann, E., Ermel, C., Taentzer, G.: Formal foundation of consistent emf model transformations by algebraic graph transformation. Softw. Syst. Model. 11(2), 227–250 (2012)

    Article  Google Scholar 

  5. Drewes, F., Hoffmann, B., Janssens, D., Minas, M.: Adaptive star grammars and their languages. Theor. Comput. Sci. 411(34–36), 3090–3109 (2010)

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  7. Golas, U., Biermann, E., Ehrig, H., Ermel, C.: A visual interpreter semantics for statecharts based on amalgamated graph transformation. ECEASST 39, 1–24 (2011)

    Google Scholar 

  8. Golas, U.: Analysis and correctness of algebraic graph and model transformations. Ph.D. thesis, Berlin Institute of Technology (2011)

    Google Scholar 

  9. Golas, U., Habel, A., Ehrig, H.: Multi-amalgamation of rules with application conditions in \(\cal M\)-adhesive categories. Math. Struct. Comput. Sci. 24(4), 51 (2014)

    Article  Google Scholar 

  10. Grønmo, R., Krogdahl, S., Møller-Pedersen, B.: A collection operator for graph transformation. In: Paige, R.F. (ed.) ICMT 2009. LNCS, vol. 5563, pp. 67–82. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  11. Habel, A., Pennemann, K.H.: Correctness of high-level transformation systems relative to nested conditions. Math. Struct. Comput. Sci. 19(2), 245–296 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  12. Mantz, F., Taentzer, G., Lamo, Y., Wolter, U.: Co-evolving meta-models and their instance models: a formal approach based on graph transformation. Sci. Comput. Program. 104, 2–43 (2015)

    Article  Google Scholar 

  13. Plump, D.: Critical Pairs in Term Graph Rewriting. In: Prívara, I., Rovan, B., Ruzička, P. (eds.) MFCS. LNCS, vol. 841, pp. 556–566. Springer, Heidelberg (1994)

    Google Scholar 

  14. Plump, D.: On termination of graph rewriting. In: Nagl, M. (ed.) GTCS. LNCS, vol. 1017, pp. 88–100. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  15. Schürr, A., Winter, A., Zündorf, A.: The PROGRES approach: language and environment. In: Handbook of Graph Grammars and Computing by Graph Transformation, pp. 487–550. World Scientific (1999)

    Google Scholar 

  16. Taentzer, G., Golas, U.: Towards Local Confluence Analysis for Amalgamated Graph Transformation: Long Version. Technical report, pp. 15–29, Zuse Institute Berlin (2015). https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/5494

Download references

Acknowledgment

We thank Yngve Lamo and Kristopher Born for their valuable comments to this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gabriele Taentzer .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Taentzer, G., Golas, U. (2015). Towards Local Confluence Analysis for Amalgamated Graph Transformation. In: Parisi-Presicce, F., Westfechtel, B. (eds) Graph Transformation. ICGT 2015. Lecture Notes in Computer Science(), vol 9151. Springer, Cham. https://doi.org/10.1007/978-3-319-21145-9_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-21145-9_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-21144-2

  • Online ISBN: 978-3-319-21145-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics