[PDF] Top 20 Volume 29: Graph Transformation and Visual Modeling Techniques 2010

... Note that the conditions of the rewriters makeChoiceW and nextStepW are the RHSs of rules makeChoice and nextStep , respectively. If it fails, an exception is thrown and the transformation stops. Otherwise, the ... See full document

... Abstract: We present a new abstract machine for interaction nets and demonstrate that an implementation based on the ideas is significantly more efficient than existing interaction net e[r] ... See full document

... for graph enrichments, in the form of added complexity in their usage and understanding (often called the learning curve), as well as in their manipulation, both on the level of theory and of ...the graph ... See full document

... The behaviour of a GSGTS can be described as a stochastic process over continuous time, where reachable graphs form the state space and the application of transformation rules defines state transitions as ... See full document

... subobject transformation system (STS) via a standard colimit construction and from this STS we construct a dependency net, given by a standard P/T Petri net, which includes a complete account of the inhibiting ... See full document

... with graph patterns together with additional application conditions, ...a graph transformation rule with application conditions and a related time calculation ... See full document

... type graph, and use the abbreviations i and o for the inside/outside ...a visual syntax where a condition ∃(a : A → Q,q) is represented by a box, separated into two parts by a horizontal line, with the top ... See full document

... a transformation of an arbitrary race-free HMSC into an equivalent trace-race-free HMSC with open coregions, where equivalence means that the two HMSCs have the same ... See full document

... typed graph terms, so that well- typed terms correspond to binding bigraphs, and congruence captures bigraphic equality; this interpretation and corresponding properties are exposed in Section ... See full document

... for graph transformation rules has already been considered in several papers: in [FL97, BPR03] shape types and shapes are introduced in order to describe graph ...expressive graph reduction ... See full document

... the transformation itself rather than the pre/post models is performed, thus having a more direct proof principle and avoiding the proof overhead of correspondence graphs and applicability ...correspondence ... See full document

... and graph grammars are apparent choices for such ...models. Graph grammars, in contrast, offer a natural procedure – the derivation process – for generating example models, and they support proofs because ... See full document

... In a difunctionally closed collagory, the operation ∗ produces difunctional closures [Kah09a]. Requiring least morphisms satisfying zero laws turns collagories into distributive allegories, which still heave a much ... See full document

... In previous work, we have proposed a pattern-based approach as a solution for in- cremental diagram layout in visual language editors. Each LP encapsulates certain layout behavior. A diagram’s layout is then ... See full document

... of graph transformation rules pays off only for complex model transformation tasks ...behavioral modeling are sufficiently expressive and more concise than graph transformation ... 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

... The behaviour of the system is modelled by the hypergraph transformation rules in Figure 5. Rules enterServer [leaveServer] allow a process to enter [leave] a server location. Both rules are inverse to each other ... 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

... alternating graph automata. We have shown by example that alternating graph automata can elegantly express various graph properties, and have compared their expressive power to other mechanisms for ... See full document

... of graph to include boxes which can be source or target of edges (in particular, target of annotation edges), we extend the definition of annotation provided in [BP12], and provide here a formal characterisation ... See full document