Repotting the Geraniums: On Nested Graph Transformation Rules

@article{Rensink2009RepottingTG,
  title={Repotting the Geraniums: On Nested Graph Transformation Rules},
  author={Arend Rensink and Jan-Hendrik Kuperus},
  journal={ECEASST},
  year={2009},
  volume={18}
}
We propose a scheme for rule amalgamation based on nested graph predicates. Essentially, we extend all the graphs in such a predicate with right hand sides. Whenever such an enriched nested predicate matches (i.e., is satisfied by) a given host graph, this results in many individual match morphisms, and thus many “small” rule applications. The total effect… CONTINUE READING

8 Figures & Tables

Topics

Statistics

010202009201020112012201320142015201620172018
Citations per Year

57 Citations

Semantic Scholar estimates that this publication has 57 citations based on the available data.

See our FAQ for additional information.