Contextual Hyperedge Replacement
2012 (English)In: Applications of Graph Transformations with Industrial Relevance: 4th International Symposium, AGTIVE 2011, Budapest, Hungary, October 4-7, 2011, Revised Selected and Invited Papers / [ed] Andy Schürr, Daniel Varro, Gergely Varro, Berlin: Springer Berlin/Heidelberg, 2012, 182-197 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
Berlin: Springer Berlin/Heidelberg, 2012. 182-197 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 7233
Research subject Computer Science
IdentifiersURN: urn:nbn:se:umu:diva-53905DOI: 10.1007/978-3-642-34176-2_16ISBN: 978-3-642-34175-5ISBN: 978-3-642-34176-2OAI: oai:DiVA.org:umu-53905DiVA: diva2:514198
4th International Symposium, AGTIVE 2011, Budapest, Hungary, October 4-7, 2011