Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

ACTA
2015

favoriteEmaildiscussreport

5views more ACTA 2015»

Contextual hyperedge replacement

8 years 12 days ago

Contextual hyperedge replacement

Download www.informatik.uni-bremen.de

Abstract. In model-driven design, the structure of software is commonly speciﬁed by meta-models like uml class diagrams. In this paper we study how graph grammars can be used for this purpose. We extend context-free hyperedge-preplacement—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 speciﬁed by class diagrams alone.

Frank Drewes, Berthold Hoffmann

Real-time Traffic

ACTA 2015 |

claim paper

Related Content

» SecondOrder Abstract Categorial Grammars as Hyperedge Replacement Grammars

» Synchronized Hyperedge Replacement for Heterogeneous Systems

» Synchronised Hyperedge Replacement as a Model for Service Oriented Computing

» Parsing of Hyperedge Replacement Grammars with Graph Parser Combinators

» Hyperedge Replacement Graph Grammars

» From Separation Logic to Hyperedge Replacement and Back

» From Hyperedge Replacement to Separation Logic and Back

» Sparse random graphs with clustering

» On Relaxing Contextual Preference Queries

» Evolutionary hypernetwork models for aptamerbased cardiovascular disease diagnosis

Post Info
More Details (n/a)

Added	13 Apr 2016
Updated	13 Apr 2016
Type	Journal
Year	2015
Where	ACTA
Authors	Frank Drewes, Berthold Hoffmann

Comments (0)