Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Theory and Application of Graph Transformations

TAGT 1998: Theory and Application of Graph Transformations pp 117–130Cite as

Node Replacement in Hypergraphs: Translating NCE Rewriting into the Pullback Approacht

  • Conference paper

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

Abstract

One of the basic concepts for the transformation of graphs is node replacement, in particular the NCE approach. As graphs do not offer a sufficiently rich model for certain applications, NCE rewriting has been generalized to directed hypergraphs where an edge may be incident to an arbitrarily long sequence of nodes. At the same time, pullback rewriting has been proposed as a generic mechanism for node replacement which allows to study this concept independently of any concrete graph (or hypergraph) model. This paper shows how node rewriting in directed hypergraphs fits in the abstract framework of the pullback approach.

Partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) through the University of Bordeaux I (the research for this paper has been carried out during the second author’s stay in Bordeaux) and by the ESPRIT Basic Research Working Group APPLIGRAPH (Applications of Graph Transformation).

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. Bauderon, M.: A category-theoretical approach to vertex replacement: The generation of infinite graphs. In: Cuny, J., Engels, G., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol. 1073, pp. 27–37. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  2. Bauderon, M., Courcelle, B.: Graph expressions and graph rewriting. Mathematical Systems Theory 20, 83–127 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bauderon, M., Jacquet, H.: Pullback as a generic graph rewriting mechanism. To appear in Applied Categorical Structures. A previous version is Categorical product as a generic graph rewriting mechanism, Technical Report 1166–97, LaBRI, University of Bordeaux (1996)

    Google Scholar 

  4. Bauderon, M., Jacquet, H.: Node rewriting in hypergraphs. In: D’Amore, F., Franciosa, P.G., Marchetti-Spaccamela, A. (eds.) WG 1996. LNCS, vol. 1197, pp. 31–43. Springer, Heidelberg (1997)

    Google Scholar 

  5. Courcelle, B., Engelfriet, J., Rozenberg, G.: Handle-rewriting hypergraph grammars. Journal of Computer and System Sciences 46, 218–270 (1993)

    Article  MATH  MathSciNet  Google Scholar 

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

    Chapter  Google Scholar 

  7. Engelfriet, J., Rozenberg, G.: Node replacement graph grammars. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation. Vol. I: Foundations, ch. 1, pp. 1–94. World Scientific, Singapore (1997)

    Chapter  Google Scholar 

  8. Habel, A., Kreowski, H.-J.: May we introduce to you: Hyperedge replacement. In: Ehrig, H., Nagl, M., Rosenfeld, A., Rozenberg, G. (eds.) Graph Grammars 1986. LNCS, vol. 291, pp. 15–26. Springer, Heidelberg (1987)

    Google Scholar 

  9. Herrlich, H., Strecker, G.: Category Theory, 2nd edn. Heldermann, Berlin (1979)

    MATH  Google Scholar 

  10. Janssens, D., Rozenberg, G.: On the structure of node-labelcontrolled graph languages. Information Sciences 20, 191–216 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  11. Janssens, D., Rozenberg, G.: Graph grammars with neighbourhood-controlled embedding. Theoretical Computer Science 21, 55–74 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  12. Kim, C., Jeong, T.E.: HRNCE grammars – a hypergraph generating system with an eNCE way of rewriting. Theoretical Computer Science 233, 143–178 (1999)

    Article  MathSciNet  Google Scholar 

  13. Klempien-Hinrichs, R.: The generative power of context-free node rewriting in hypergraphs (submitted for publication)

    Google Scholar 

  14. Klempien-Hinrichs, R.: Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol. 1073, pp. 397–411. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  15. Klempien-Hinrichs, R.: Net refinement by pullback rewriting. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, pp. 189–202. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  16. Nagl, M.: Graph-Grammatiken: Theorie, Anwendungen, Implementierungen. Vieweg, Braunschweig (1979)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire Bordelais de Recherche en Informatique, Université Bordeaux I, 351, Cours de la Libération, 33405, Talence Cedex, France

    Hélène Jacquet

  2. Universität Bremen, Fachbereich 3, Postfach 33 04 40, 28334, Bremen, Germany

    Renate Klempien-Hinrichs

Authors
  1. Hélène Jacquet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Renate Klempien-Hinrichs
    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. Department of Computer Science, University of Bremen, P.O. Box 33 04 40, 28334, Bremen, Germany

    Hans-Jörg Kreowski

  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

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jacquet, H., Klempien-Hinrichs, R. (2000). Node Replacement in Hypergraphs: Translating NCE Rewriting into the Pullback Approacht. In: Ehrig, H., Engels, G., Kreowski, HJ., Rozenberg, G. (eds) Theory and Application of Graph Transformations. TAGT 1998. Lecture Notes in Computer Science, vol 1764. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46464-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-46464-8_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67203-6

  • Online ISBN: 978-3-540-46464-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation