[PDF] Top 20 Volume 58: Graph Transformation and Visual Modeling Techniques 2013

... substitution graph we will use the graph G that consists of one vertex (that also is the merge- vertex), one b-edge and one c-edge, both of arity ... See full document

... a visual language with ...and graph grammars [Min02, ...with graph transformations to generate editors that support both free-hand and syntax-directed ...the visual editor, much like ... See full document

... To fulfill the outlined requirements, several different concepts are employed. An interactive navigation is only feasible, for technical as well as user-interface reasons, if the graph-structure in scope is kept ... See full document

... of visual contracts and their dependency graph, the generation is an iteration of three ...dependency graph are gener- ated, augmented by additional rules to cater for cases with multiple ... See full document

... There are several tools around that consider the co-evolution of Eclipse Modeling Framework (EMF) models. COPE (now:Edapt) [HBJ09] provides a rich set of co-evolution operators that implement evolution and ... See full document

... system modeling, the need often arises to identify specific configurations within a complex model, and refer to them as a ...pattern-based modeling, especially of software systems, where several software ... See full document

... Abstract: Graph transformations have been used to model services and systems where rules describe pre and post conditions of operations changing a complex ...neering visual constructs from observations of ... See full document

... by graph transformation ...the graph pattern the two parameters are shown with rounded corners and the current object, an instance of the BugTracker class, marked with ... See full document

... As a knowledge map grows over time, it is likely to become complex and increasingly difficult to analyse visually. It would be useful for an analyst to be able to filter out all the noise in a knowl- edge map and be ... See full document

... Hypergraph transformation systems are examples of M -adhesive trans- formation systems based on M -adhesive ...attributed graph transformation systems, the tool environment A GG allows the modelling, ... See full document

... A LP (cf. Figure 3) is defined on top of a pattern-specific meta-model (PMM). It has one or more associated p-constraints (pattern-constraints), and each p-constraint consists of one predi- cate, which in turn has one or ... See full document

... Compensation concerns often crosscut other programming concerns and thus attempting to pro- gram compensations within the main flow of a program would clutter the program and also limit the expressivity of compensation ... See full document

... During play-out, symbolic MSDs and binding expressions are interpreted as follows: As a message event can be (parameter) unified with a first message in an MSD, an active MSD is created [r] ... See full document

... CSP transformation: The authors of [WDS09] perform a cartesian flattening to transform feature models into a knappsack problem which is solved and used to generate representative subsets of products of the ...the ... See full document

... a graph that satisfy a given regular expression is particularly problematic as the matches for a regular expression with transitive closures are neither of a fixed size, nor is there always a finite number of them ... See full document

... algebraic graph transformation approach was initiated in 1973 and supports the rule-based modification of graphs based on pushout ...for graph transformation sys- tems without inheritance ... See full document

... a graph is available, and studies the application of rules to such sub-graphs in a way that is compatible with the original, reductive ...a graph in which some of the required structure (“context”) for the ... See full document

... Meta modeling is a wide-spread technique to define visual languages, with the UML being the most prominent ...meta modeling such as ease of use, the meta modeling approach has a major ... See full document

... The adapter is required to translate invocations of services under test into rule applications, passing and converting parameters and interpreting replies. Conversion is required because model and implementation ... See full document

... 3. If the source node is a fork with three or more outgoing edges, the source node of its incoming edge will also be linked with the pin secI. Moreover, we connect the pin secAc to the fork such that it is only passed in ... See full document