[PDF] Top 20 Volume 39: Graph Computation Models 2010

... of graph transformations to analyze behavioral statechart properties due to the complex control ...mated graph transformation where rule schemes are used to handle an arbitrary number of transitions in ... See full document

... left graph comprise only variables and constants because their values at execution time are determined by graph ...the graph to which the rule schema is ...left graph is ... See full document

... We have shown how to construct pushout complements when both given morphisms might be non-injective. Such a construction is necessary for performing backwards analysis and com- puting the set of predecessors of a given ... See full document

... discrete graph formed by the structural nodes in X which are attached to edges in E (Y ) ∖ E(c(X)), and the context of c is the attributed typed graph Q which is the pushout complement along X ′ for X ′ → x ... See full document

... regions. There, in parallel a producer, a buffer, and a consumer may act. The producer alternates between the states produced and prepare, where the transition produce models the actual production activity. It is ... See full document

... Abstract: When trying to obtain formally certified model transformations, one may want to represent models as graphs and graphs as greatest fixed points. To do so, one is rather naturally led to define ... See full document

... It is easy to check whether a given instance graph is compatible with a class diagram. In con- trast, constructing sample instance graphs for a class diagram is rather difficult. This, however, is important to ... See full document

... 6: Graph transformations coupled to language-extending/-reducing grammar transforma- tion operators, in the same format as used on the previous ...the graph transformation specifica- tion looks very ...the ... See full document

... the collateral effect, both must be “on stock”; however, just placing a new left hand side where the current one was consumed is not a solution, because one of the rule e ff ects will be applied “for real” on the ... See full document

... The TGG schema for our running example, a variant of ModelTests [Ste] from the bx examples repository [CMSG14], is depicted in Fig. 1. The source metamodel represents a simple language of class diagrams consisting of a ... See full document

... of models we are interested in: ...which models its movement, and if both rules are applied in parallel, there is a conflict between deletion and preservation, but it makes perfect sense to prefer deletion ... See full document

... Manual specification approaches like [SK04, RKPP10] follow a different idea. Instead of de- tecting semantic changes, these approaches migrate models by copying as much as possible from a previous model version to ... See full document

... of computation based on a restricted form of graph rewriting: the rewrite rules must be between two nodes on the left-hand side, be local (not change any part of graph other than the two nodes), and ... See full document

... the graph transformation field, although they are largely used in modeling, human computer interaction, information retrieval and the Semantic ...hyper- graph annotation is a morphism from a (typed) ... See full document

... Unfortunately, the framework of M -adhesive systems does not cover graph transformation with relabelling. In [HP12], the authors generalize M -adhesive categories to M , N -adhesive categories, where N is a class ... See full document

... of models which have been used in various fields of computer ...of models, especially visual models, can be described best by graphs, due to their multidimensional ...by graph transformation ... See full document

... A situation as in the preceding example often occurs in the software engineering area of model transformation where objects in a source model must be mapped to objects in a target model. The transformation process starts ... See full document

... type graph of the main body is never unselected in the µ -condition but is instead mapped in a consistent way as a subgraph of the type graph of each ... See full document

... by graph-like diagrams, and with a behavior described by incremental ...popular. Graph rewriting is a natural formalism, which has been used to specify such systems in an abstract way, ever since this ... See full document

... modelling graph structures using coalgebras in ...DPO graph transformation literature, and in particular the adhesive approach, prescibe them, we prove a characterisation of monomorphisms in categories of ... See full document