[PDF] Top 20 Volume 6: Graph Transformation and Visual Modeling Techniques 2007

... Denoting the mapping from activity diagrams to CSP by c, the idea of rule-level verification is illustrated in Figure 16. The original business process is given by graph G, the redesigned one by the resulting ... See full document

... To realize the transformation from activities to state machines introduced above, we can proceed in quite different ways. For instance, one could perform a complete reachability analysis over all allowed token ... See full document

... the graph production. When the application of a graph production would delete a node but not all of its adjacent edges, those dangling edges will also be ... See full document

... basic transformation entity of a GReAT transformation is called a transformation ...a graph pattern specified using the pattern specification language and an action on the pattern elements or ... See full document

... Some approaches to model transformation are found in the literature to handle recursive appli- cations of a rule. Usually, they are based on the use of some control flow language that guides the ... See full document

... of graph transformation systems, but does not provide a theoretical foundation that is as powerful as in the algebraic ...a graph transformation rule is defined by set-theoretic ...within ... See full document

... We use the described framework in application development since a couple of years. More precisely, we have developed the framework from prototypes, which have been developed in re- search projects. Hence, we used a ... See full document

... This paper opens a number of other research questions at the theoretical level. One of the main reasons for using recursion patterns and datatype-generic programming is that this style of programming is good for ... See full document

... Abstract: In industry, there are many workflow management systems (wfms) which have been incrementally developed over a long time. The workflow definition languages that come along with these wfms are mostly graph ... See full document

... initial graph is clustered so that a tree is ...initial graph is dense and possesses a large number of ...associated graph. Since the initial graph can be dense and large, so may be the ... See full document

... advanced graph patterns with edge identities, containment constraints, type variables, negative application conditions, attribute conditions, and injectivity ...search graph representation, all search plan ... See full document

... The structure of the subgraph represented in a star region must follow some specific require- ments. This is necessary, as the patterns used for defining a query as well as new patterns that are generated by expanding ... See full document

... Triple Graph Grammars (TGGs) allow the specification of high-level rules modelling the synchronized creation of elements in two graphs related through a correspondence ...one graph to the other, and their ... See full document

... through transformation rules. Basing model transformation on graph transformation, rules consist of one positive pattern, an arbitrary number of negative patterns and a description of the ... See full document

... and graph transformation systems, where the extension of the DPO approach to borrowed contexts provides us with a formal basis for reasoning about bisimilarity of ...model transformation which ... See full document

... Besides, observe that there is redundancy between transfer-1 and transfer-2 of both splits. This redundancy originates from the fact that both splits have a node in common, which is one of the machines. This redundancy ... See full document

... alternating graph automata (denoted by AA ) is compared to that of linear and general HRG s (denoted by LHRG and HRG , respectively) and bounded and general automa- ton functors (denoted by BAF and AF , respec- ... See full document

... know graph drawing library. These layout engines are best suited for graph-based visual languages, whereas our approach supports all kinds of visual ... See full document

... We discuss here the case in which the annotation domain is restricted to a single type of element used for annotating and to the use of only the dominating relation. The annotation process is employed to place additional ... See full document

... To better demonstrate the behavior of RETE , some of the runs in our experiment made use of a subset of the rules. The experiment was performed on a machine with a dual core 1.6GHz Intel CPU and 2.5GB of RAM. Table 1 ... See full document