Skip to main content
SpringerLink
Log in

Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence

  • Graph Languages
  • Conference paper
  • First Online:
Graph Grammars and Their Application to Computer Science (Graph Grammars 1994)

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

Abstract

Node replacement in directed labelled hypergraphs as a generalization of node replacement in directed labelled graphs is introduced. This hypergraph grammar approach can simulate hyperedge replacement in hypergraphs. The problem whether a given hNCE-grammar is confluent is rather complex but decidable.

Supported by a scholarship of the University of Bremen and the ESPRIT Basic Research Working Group No. 7183: COMPUGRAPH II.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Franz J. Brandenburg: On polynomial time graph grammars. In: STACS 88 (R. Cori, Martin Wirsing, Eds.), Lecture Notes in Computer Science 294, 227–236, 1988.

    Google Scholar 

  2. Bruno Courcelle: An axiomatic definition of context-free rewriting and its application to NLC graph grammars. Theoretical Computer Science 55, 141–181, 1987.

    Google Scholar 

  3. Bruno Courcelle, Joost Engelfriet, Grzegorz Rozenberg: Handle-rewriting hypergraph grammars. Journal of Computer and System Science 46, 218–270, 1993.

    Google Scholar 

  4. Joost Engelfriet, Grzegorz Rozenberg: A comparison of boundary graph grammars and context-free hypergraph grammars. Information and Computation 84, 163–206, 1990.

    Google Scholar 

  5. Joost Engelfriet, Grzegorz Rozenberg: Graph grammars based on node rewriting: an introduction to NLC graph grammars. In: Graph Grammars and Their Application to Computer Science (Hartmut Ehrig, Hans-Jörg Kreowski, Grzegorz Rozenberg, Eds.), Lecture Notes in Computer Science 532, 12–23, 1991.

    Google Scholar 

  6. Rainer Fehling: A concept of hierarchical Petri nets with building blocks. In: Advances in Petri Nets (Grzegorz Rozenberg, Ed.), Lecture Notes in Computer Science 674, 148–168, 1993.

    Google Scholar 

  7. Rob van Glabbeek, Ursula Goltz: Refinement of actions in causality based models. In: Stepwise Refinement of Distributed Systems (Jaco W. de Bakker, Willem Paul de Roever, Grzegorz Rozenberg, Eds.), Lecture Notes in Computer Science 430, 267–300, 1990.

    Google Scholar 

  8. Annegret Habel: Hyperedge Replacement: Grammars and Languages. Lecture Notes in Computer Science 643, 1992.

    Google Scholar 

  9. Manfred Kaul: Syntaxanalyse von Graphen bei Präzedenz-Graph-Grammatiken. Ph.D. thesis, Osnabrück 1985. Report MIP-8610, Passau 1986.

    Google Scholar 

  10. Changwook Kim, Tae Eui Jeong: HRNCE grammars — a hypergraph generating system with an eNCE way of rewriting. This volume.

    Google Scholar 

  11. Manfred Nagl: Formal languages of labelled graphs. Computing 16, 113–137, 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Bremen, Fachbereich 3, Postfach 33 04 40, D-28334, Bremen

    Renate Klempien-Hinrichs

Authors
  1. Renate Klempien-Hinrichs
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Janice Cuny Hartmut Ehrig Gregor Engels Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klempien-Hinrichs, R. (1996). Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1994. Lecture Notes in Computer Science, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61228-9_101

Download citation

  • DOI: https://doi.org/10.1007/3-540-61228-9_101

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61228-5

  • Online ISBN: 978-3-540-68388-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation