In model-driven design, the structure of software is commonly specified by meta-models like uml class diagrams. In this paper we study how graph grammars can be used for this purpose, using statecharts as an example. We extend context-free hyperedge-replacement-which is not powerful enough for this application-so that rules may not only access the nodes attached to the variable on their left-hand side, but also nodes elsewhere in the graph. Although the resulting notion of contextual hyperedge replacement preserves many properties of the context-free case, it has considerably more generative power-enough to specify software models that cannot be specified by class diagrams. © 2012 Springer-Verlag.
CITATION STYLE
Drewes, F., Hoffmann, B., & Minas, M. (2012). Contextual hyperedge replacement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7233 LNCS, pp. 182–197). https://doi.org/10.1007/978-3-642-34176-2_16
Mendeley helps you to discover research relevant for your work.