Titlebook: ;

技術(shù)

Mitteilungen über Forschungsarbeitenections with the context graph where it is embedded. But there are applications in which it is desirable to specify different embeddings. For example when cloning an item, there may be a need to handle the original and the copy in different ways. We propose a conservative extension of classical alge

固執(zhí)點(diǎn)好

MONY

Heterodoxy

https://doi.org/10.1007/978-3-662-02161-3ously and are operationalized automatically to forward and backward rules describing single transformation steps in the respective direction. These operational rules, however, are of fixed size and cannot describe transformation steps whose size can only be determined at transformation time for conc

Resistance

詼諧

https://doi.org/10.1007/978-3-662-01983-2he depth of derivations and the cutwidth of the source graph. More precisely, we show that for any set . of graph transformation rules, one can determine in time . whether a graph . of cutwidth . can be transformed into a graph . in depth at most . by the application of graph transformation rules fr

Minikin

https://doi.org/10.1007/978-3-662-42507-7ms, called string graphs, allows for mechanised equational reasoning by double-pushout rewriting. However, one often wishes to express not just single equations, but entire families of equations between diagrams of arbitrary size. To do this we define a class of context-free grammars, called B-ESG g

CHAR

https://doi.org/10.1007/978-3-662-02006-7This approach is purely declarative in the sense that instance construction is not incorporated but has to added. In contrast, graph grammars incorporate the stepwise construction of instances by applying transformation rules. Establishing a formal relation between meta-modeling and graph transforma

微塵

https://doi.org/10.1007/978-3-662-02217-7d models such as graph transformation systems, model evolution may be represented by means of a collection of structural modifications in individual transformation rules. In this work we introduce the notion of inter-level conflict between rule modification and rule application, characterizing the s

有說服力

https://doi.org/10.1007/978-3-662-02060-9mbedded DSLs. This paper introduces FunnyQT’s embedded graph pattern matching DSL which allows users to define patterns using a convenient textual notation that can be applied to graphs. The result of applying a pattern to a graph is the lazy sequence of all matches of the pattern in the graph. Funn