Change search
ReferencesLink to record
Permanent link

Direct link
Contextual Hyperedge Replacement
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Natural and Formal Languages)
DFKI Bremen and Universität Bremen.
Universität der Bundeswehr München.
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)
Abstract [en]

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
National Category
Computer Science
Research subject
Computer Science
URN: urn:nbn:se:umu:diva-53905DOI: 10.1007/978-3-642-34176-2_16ISBN: 978-3-642-34175-5ISBN: 978-3-642-34176-2OAI: diva2:514198
4th International Symposium, AGTIVE 2011, Budapest, Hungary, October 4-7, 2011
Available from: 2012-04-10 Created: 2012-04-05 Last updated: 2014-03-31Bibliographically approved

Open Access in DiVA

fulltext(528 kB)50 downloads
File information
File name FULLTEXT03.pdfFile size 528 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Drewes, Frank
By organisation
Department of Computing Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 138 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 82 hits
ReferencesLink to record
Permanent link

Direct link