### Table 3: Patterns of Rewriting Candidates

1999

"... In PAGE 7: ... For #0B-rewriting candidates we employ the ge- neric notation r#28#16s; f #14 #28 Y #16 z#29#29 #20 B; where #14 is the canonical aggregate term for #0B. To make our generic de#0Cnition more intuitive, we spec- ify in Table3 the format of the candidates for the di#0Berent aggregate functions. Recall that for count only pure candi- dates are de#0Cned.... In PAGE 7: ... For the sake of simplicity we present in this paper only the proof for count-rewriting candidates. Recall that for count only pure rewriting candidates are de#0Cned #28see Table3 #29. A count-rewriting candidate has the form: r#28#16s; sum#28 n Y i=1 z i #29#29 #20 v 1 #28#12 1 #16 s 1 ;z 1 #29 amp; ::: amp;v n #28#12 n #16 s n ;z i #29 amp;C: As wehave shown in the long version of this paper, one can assume that the views in r are not instantiated.... ..."

Cited by 75

### 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 5: State machine feature coverage of rewriting approaches Rewriting Approaches

2006

"... In PAGE 30: ... Tables 4, 5 and 6 show in detail how well each approach covers specific UML state machine features. Table 4 details the mathematical model approaches, Table5 the rewriting approaches, and Table 6 the translation approaches. Table 3 provides the legend for these three tables.... ..."

### Table 3: The rewrite system R

1996

"... In PAGE 6: ...Table 3: The rewrite system R Table3 presents a rewrite system R, which consists of directions of the axioms A4,5 and BKS2, pointing from left to right. The rules in R are to be interpreted modulo AC of the +.... ..."

Cited by 5

### Table 2. Guarantee rewrite matrix

2001

"... In PAGE 7: ... Clearly, the re- verse conversion cannot be performed: a fixed fraction of the CPU over an unspecified time interval is not, in general, equivalent to any particular CPU reservation. Table2 shows which guarantees can be converted into which others using rewrite rules. Characters in the matrix indicate whether the guarantees listed on the left can be con- verted to the guarantees listed on the bottom.... ..."

Cited by 42

### 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 4. Rewriting bitonal trees.

2004

"... In PAGE 9: ... Rewriting bitonal trees. Tree interactions are presented in Table4 . Even numbered vertices corre- sponding to one colour and odd numbered ones to the other.... ..."

Cited by 12

### Table 1: The Rewrite Rules 9

"... In PAGE 14: ... We believe this makes our results more interesting than one in which it is assumed that these laws are operationally valid from the outset. The rewrite rules are presented in Table1 . They are presented in natural deduction style as a relation on L which is denoted by a footed arrow 7!.... ..."

### Table 3: The rewrite system R

1996

"... In PAGE 10: ...7 For each term p there exists a basic term q with g(q) g(p) and p = q. Proof: The rewrite system R in Table3 reduces each occurrence of sequential compo- sition in which the left-hand side is not an atomic action. It applies to process terms modulo AC of the + (but not modulo pre xing with quot;).... ..."

Cited by 1