Skip to main content
SpringerLink
Log in
Book cover

International Conference on Graph Transformation

ICGT 2004: Graph Transformations pp 178–193Cite as

Parallel Independence in Hierarchical Graph Transformation

  • Conference paper

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

Abstract

Hierarchical graph transformation as defined in [1,2] extends double-pushout graph transformation in the spirit of term rewriting: Graphs are provided with hierarchical structure, and transformation rules are equipped with graph variables. In this paper we analyze conditions under which diverging transformation steps \(H \Leftarrow G \Rightarrow H'\) can be joined by subsequent transformation sequences \(H \stackrel *{\Rightarrow} M \stackrel *{\Leftarrow} H'\). Conditions for joinability have been found for graph transformation (called parallel independence) and for term rewriting (known as non-critical overlap). Both conditions carry over to hierarchical graph transformation. Moreover, the more general structure of hierarchical graphs and of transformation rules leads to a refined condition, termed fragmented parallel independence, which subsumes both parallel independence and non-critical overlap as special cases.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Drewes, F., Hoffmann, B., Plump, D.: Hierarchical graph transformation. Journal of Computer and System Sciences 64, 249–283 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  2. Hoffmann, B.: Shapely hierarchical graph transformation. In: Proc. IEEE Symposia on Human-Centric Computing Languages and Environments, pp. 30–37. IEEE Computer Press, Los Alamitos (2001)

    Chapter  Google Scholar 

  3. Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation. Foundations, vol. 1. World Scientific, Singapore (1997)

    Google Scholar 

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

    Google Scholar 

  5. Ehrig, H., Kreowski, H.J., Montanari, U., Rozenberg, G. (eds.): Handbook of Graph Grammars and Computing by Graph Transformation. Concurrency, Parallelism, and Distribution, vol. 3. World Scientific, Singapore (1999)

    Google Scholar 

  6. Busatto, G.: An Abstract Model of Hierarchical Graphs and Hierarchical Graph Transformation. PhD thesis, Universität-Gesamthochschule Paderborn (2002)

    Google Scholar 

  7. Ehrig, H.: Introduction to the algebraic theory of graph grammars. In: Ng, E.W., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1978. LNCS, vol. 73, pp. 1–69. Springer, Heidelberg (1979)

    Chapter  Google Scholar 

  8. Engels, G., Heckel, R.: Graph transformation as a conceptual and formal framework for system modelling and evolution. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 127–150. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  9. Plump, D., Habel, A.: Graph unification and matching. In: Cuny, J., Engels, G., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol. 1073, pp. 75–89. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  10. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)

    Google Scholar 

  11. Hoffmann, B.: Abstraction and control for shapely nested graph transformation. Fundamenta Informaticae 58 (1), 39–65 (2003)

    MATH  MathSciNet  Google Scholar 

  12. Ehrig, H., Kreowski, H.J.: Parallelism of manipulations in multidimensional information structures. In: Mazurkiewicz, A. (ed.) MFCS 1976. LNCS, vol. 45, pp. 284–293. Springer, Heidelberg (1976)

    Google Scholar 

  13. Ehrig, H., Habel, A., Padberg, J., Prange, U.: Adhesive high-level replacement categories and systems. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 144–160. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Habel, A., Müller, J., Plump, D.: Double-pushout graph transformation revisited. Mathematical Structures in Computer Science 11, 637–688 (2001)

    Article  MATH  Google Scholar 

  15. Ehrig, H., Habel, A., Kreowski, H.J., Parisi-Presicce, F.: Parallelism and concurrency in high level replacement systems. Mathematical Structures in Computer Science 1, 361–404 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  16. Plump, D.: Hypergraph rewriting: Critical pairs and undecidability of confluence. In: Term Graph Rewriting: Theory and Practice, pp. 201–213. John Wiley, New York (1993)

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Carl-v.-Ossietzky-Universität Oldenburg, Germany

    Annegret Habel

  2. Universitität Bremen, Germany

    Berthold Hoffmann

Authors
  1. Annegret Habel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Berthold Hoffmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Technische Universität Berlin, Germany

    Hartmut Ehrig

  2. University of Paderborn, Warburger Straße 100, 33098, Paderborn, Germany

    Gregor Engels

  3. George Mason University, Fairfax, Virginia, USA

    Francesco Parisi-Presicce

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

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Habel, A., Hoffmann, B. (2004). Parallel Independence in Hierarchical Graph Transformation. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds) Graph Transformations. ICGT 2004. Lecture Notes in Computer Science, vol 3256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30203-2_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30203-2_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23207-0

  • Online ISBN: 978-3-540-30203-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation