Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

A kernel language for programmed rewriting of (hyper)graphs

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

The paper presents a formalism for rewriting (hyper)graphs in a controlled manner. This formalism is essentially a simple programming language with productions, that is rewriting rules, playing the role of basic instructions. Programs in this language are built from productions by means of rather standard constructors, including a parallel composition. They may contain parameters to point to specific elements of graphs to which they are supposed to be applied. Programs are intended to describe how to transform a graph and a valuation of parameters in this graph in order to reach a resulting graph and a resulting valuation of parameters.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bunke, H.: Programmed Graph Grammars, in [CER 79], pp. 155–166

  2. Claus, V., Ehrig, H., Rozenberg, G. (eds.): Proceedings of the 1st International Workshop on Graph-Grammars and Their Application to Computer Science and Biology, Springer LNCS 73, 1979.

  3. Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Löwe, M.: Logic Programming and Graph Grammars, in [EKR 91], pp.221–237.

  4. Corradini, A., Rossi, F.: Hyperedge Replacement Jungle Rewriting for Term-Rewriting Systems and Logic Programming, Theoretical Computer Science 109 (1993) pp. 7–48.

    Article  MATH  MathSciNet  Google Scholar 

  5. Corradini, A., Rossi, F., Parisi-Presicce, F.: Logic Programming as Hypergraph Rewriting, in the Proceedings of CAAP’91, Springer LNCS 493, 1991. pp.275–295.

  6. Ehrig, H., Kreowski, H.-J., Maggiolo-Schettini, A., Rosen, B.K., Winkowski, J.: Transformations of Structures: An Algebraic Approach, Math. Systems Theory 14 (1981) pp. 305–334.

    Article  MATH  MathSciNet  Google Scholar 

  7. Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.): Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science, Springer LNCS 532, 1991.

  8. Ehrig, H., Nagl, M., Rozenberg, G. (eds.): Proceedings of the 2nd Workshop on Graph-Grammars and Their Application to Computer Science, Springer LNCS 153, 1983.

  9. Ehrig, H., Nagl, M, Rozenberg, G., Rosenfeld, A. (eds.): Proceedings of the 3rd Workshop on Graph-Grammars and Their Application to Computer Science, Springer LNCS 291, 1987.

  10. Ehrig, H., Pfender, H., Schneider, H. J.: Graph Grammars: An Algebraic Approach, Proc. of the IEEE Conf. on Automata and Switching Theory, Iowa City 1973, pp.167–180.

  11. Janssens, D., Rozenberg, G.: Structured Transformations and Computation Graphs for Actor Grammars, in [EKR 91], pp.446–460.

  12. Maggiolo-Schettini, A., Winkowski, J.: Towards a Programming Language for Manipulating Relational Data Bases, in: Bjorner, D., (Ed.), Formal Description of Programming Concepts II, North-Holland, 1983, pp.265–278.

  13. Maggiolo-Schettini, A., Winkowski, J.: Programmed Derivations of Relational Structures, in [EKR 91], pp.582–598.

  14. Maggiolo-Schettini, A., Winkowski, J.: A Programming Language for Deriving Hypergraphs, in Springer LNCS 581, 1992, pp. 221–231.

    Google Scholar 

  15. Maggiolo-Schettini, A., Winkowski, J.: A Formalism for Programmed Rewriting of Hypergraphs, Report 745 of the Institute of Computer Science, Warsaw, 1994.

  16. Nagl, M.: A Programming Language for Handling Dynamic Problems on Graphs, in Pape, U. (ed.): Discrete Structures and Algorithms, Proc. of WG’79 5th Workshop on Graphtheoretic Concepts in Computer Science, Hanser Verlag, 1979.

  17. Plotkin, G.: A Structural Approach to Operational Semantics, Technical Report, Computer Sc. Dept., Aarhus Univ., Denmark, DAIMI-FN-19, 1981.

    Google Scholar 

  18. Plump, D.: Graph-Reducible Term Rewriting Systems, in [EKR 91], pp.622–636.

  19. Schürr, A.: PROGRESS: A VHL-Language Based on Graph Grammars, Springer LNCS 532, pp. 641–659, 1991

    Google Scholar 

  20. Shapiro, E.: The Family of Concurrent Logic Programming Languages, ACM Computing Surveys, 21, 1989, pp. 413–510.

    Article  Google Scholar 

  21. Zündorf, A., Schürr, A.: Nondeterministic Control Structures for Graph Rewriting Systems, Springer LNCS 570, pp. 48–62, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 1-56125, Pisa, Italy

    Andrea Maggiolo-Schettini

  2. Instytut Podstaw Informatyki PAN, ul. Ordona 21, PL-01237, Warszawa, Poland

    Józef Winkowski

Authors
  1. Andrea Maggiolo-Schettini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Józef Winkowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work has been supported by the Italian National Council for Research (CNR-GNIM), by the Polish Academy of Sciences (IPI PAN), and by COMPUGRAPH Basic Research Esprit Working Group n. 7183.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Maggiolo-Schettini, A., Winkowski, J. A kernel language for programmed rewriting of (hyper)graphs. Acta Informatica 33, 523–546 (1996). https://doi.org/10.1007/BF03036461

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03036461

Keywords