### Table 1: Graph rewriting operators

1995

"... In PAGE 2: ...paradigm. 2 The Rewriting Operations A set of basic graph rewriting operations is listed in Table1 and depicted in Figure 1. Table 3 shows a grammar for growing the complete structure of an adaptive MLP.... ..."

Cited by 15

### Table 1. Graph rewriting expressions

"... In PAGE 2: ... They are independent from the normal pattern graph, except for preset elements that must be mapped to the same host graph element as the corresponding element in the pattern graph. 3 Optimizations on Graph Rewrite Sequences Table1 lists some possible graph rewrite expressions (that can be part of graph rewrite sequences) at a glance.... ..."

### Table 1. Modeling events in Statecharts and OPM Event

"... In PAGE 1: ... In this paper, OPM refers also to its OPM/T extension. Table1 provides a Statecharts model and an OPM model (both an OPD and an OPL sentence) for each one of the common event types. Comparing the models suggested for state entrance, state exit, activity start, activity stop, condition fulfillment, condition violation, and external events, we found no significant differences in the model complexity and accuracy.... In PAGE 3: ... Modeling this constraint in Statecharts is not straightforward. As the examples in Table1 demonstrate, OPL reads as natural language and thus it enhances the readability of the graphical models, making it easy for humans who are not familiar with OPM graphical notations and their semantics to interpret the semantics correctly. At the same time, OPL provides a solid infrastructure for automated code generation, which follows the common implementation of ECA rules, when dealing with events.... ..."

### Table 1: Two possible step constructions in Statecharts

"... In PAGE 28: ... The function NextConfig calculates the new state con guration given the old state con guration C and the set of transitions T . The possible constructions of a step in Fig- ure 16 are summarized in Table1 . The con guration at the beginning of the step is de ned by the set fA; Cg, assuming that I = fxg.... In PAGE 28: ...ature of the step construction (i.e., the selection of the transition to put in T is made non- deterministically), there are (in this case) three di erent ways of constructing a step; two constructions yielding di erent results are illustrated in the table. The behavior de ned in construction 1 in Table1 is counterintuitive since transition t4, which should \obviously quot; be triggered by the input event x, is not taken. The semantics of RSML is slightly di erent and enforces a more rigorous causal ordering of the transitions taken within a step.... ..."

### Table 1: Two possible step constructions in Statecharts

"... In PAGE 28: ... The function NextConfig calculates the new state con guration given the old state con guration C and the set of transitions T . The possible constructions of a step in Fig- ure 16 are summarized in Table1 . The con guration at the beginning of the step is de ned by the set fA; Cg, assuming that I = fxg.... In PAGE 28: ...ature of the step construction (i.e., the selection of the transition to put in T is made non- deterministically), there are (in this case) three di erent ways of constructing a step; two constructions yielding di erent results are illustrated in the table. The behavior de ned in construction 1 in Table1 is counterintuitive since transition t4, which should \obviously quot; be triggered by the input event x, is not taken. The semantics of RSML is slightly di erent and enforces a more rigorous causal ordering of the transitions taken within a step.... ..."

### Table 1 Representative applications of graph rewriting. Additional references for these and other applications are available on the web [17].

1999

"... In PAGE 3: ... Applications of Graph Rewriting Graph rewriting is used both in specifying and in implementing software. Table1 summarizes a variety of applications of graph rewriting. The HostGraph represents the state of the compu- tation; its structure is described in the first column of Table 1.... In PAGE 3: ... Table 1 summarizes a variety of applications of graph rewriting. The HostGraph represents the state of the compu- tation; its structure is described in the first column of Table1 . The graph rewrite rules implement the dynamic behaviour of the system, as described in the second column.... In PAGE 3: ... The graph rewrite rules implement the dynamic behaviour of the system, as described in the second column. For example, the first entry in Table1 summarizes the use of graph rewriting in specifying the semantics of an editor for a visual language. Programs in the visual language appear as dia- grams on the screen, but are internally represented by a HostGraph.... In PAGE 16: ...Graph rewriting has been used in many application areas. Nine applications of these are summarized in Table1 , and two are presented in greater detail. First, we describe an editor for precedence networks.... ..."

Cited by 14

### Table 1. A rewrite system for normalizing the representation of a graph

"... In PAGE 20: ...ST ) or an application definition (x = x1 x2). In Table1 we present a confluent and terminating rewrite system for computing standard representations. Apart from the usual conditions on lifting and garbage collection it contains a special condition on the naming rules.... ..."

### Table 3: A Semantics for CTRSs as Rewrite Relation Transformers

### Table 1. Four organizations for graph-rewriting systems.

1995

"... In PAGE 4: ... Mrs. Maggraphen: How can we organize rewrite rules? The graph-rewriting literature reports on various methods of organizing a collection of graph-rewrite rules: unordered, ordered and event-driven graph-rewriting systems, as well as graph grammars ( Table1 ). This taxonomy arose from our efforts to organize our reading of the graph rewriting literature.... ..."

Cited by 29

### Table 5. Box rewrite rules

"... In PAGE 9: ... Table 7 gives the usual cut-elimination steps, whereas Table 6 gives the extra cut-elimination steps for the \unordered n-ary quot; treat- ment we give for the contraction links. Table5 lists additional rewrites for storage boxes needed for the categorical semantics. In (Blute et al 1992) a considerable e ort was spent in making the rewiring of thinning links as \local quot; as possible (see the discussion there of rules of surgery).... In PAGE 36: ... the reductions and expansions of Tables 4, 6, 7, are just those of (Danos 1990), and so form a con uent system for which we have strong normalization. The \box-expansion quot; rules of Table5... In PAGE 40: ... A terminal storage link may be handled by a method that depends on the type of thinning link involved. For an exponential thinning, the box rewrite rule in Table5 allows us to move the thinning link outside the box. For a unit thinning, the thinning link and the empire of the unit lie either completely inside or completely outside the storage box|in either case the induction assumption is easily applied.... ..."