### TABLE 1: Interpretation of link expressions

1998

Cited by 2

### Table 5: Example parallel conventional NE for 3-link manipulator.

1998

"... In PAGE 12: ... This idea is expressed by example below. Table5 shows a possible parallel implementation of a conventional NE-based algorithm. The recursion variables are assigned to processors in a manner that distributes the workload based on the cycle times used above and data dependencies.... ..."

Cited by 1

### Table 5: Example parallel conventional NE for 3-link manipulator.

1998

"... In PAGE 12: ... This idea is expressed by example below. Table5 shows a possible parallel implementation of a conventional NE-based algorithm. The recursion variables are assigned to processors in a manner that distributes the workload based on the cycle times used above and data dependencies.... ..."

Cited by 1

### Table 7. Axioms for recursion

"... In PAGE 11: ...n the case where they occur in a recursive specification, and E, Eprime, . . . to stand for arbitrary guarded recursive specifications. The additional axioms for recursion are the equations given in Table7 . A side condition is added to restrict the variables, terms and guarded recursive specifications for which X, tX and E stand.... ..."

### Table 8. Axioms for recursion

"... In PAGE 11: ... We stipulate that xx(t) stands for D if x is unguarded in t. We add the axioms for recursion given in Table8 to the axioms of T. In this table, t stands for an arbitrary term over the signature of T + REC.... In PAGE 12: ... They can be put in the generalized panth format from [24], which guarantees that bisimulation equivalence is a congruence with respect to the recursion operators, but that requires generalizations of many notions that are material to structural operational semantics. The axioms given in Table8 are sound with respect to bisimulation equivalence. 6 State-Based Description of Services In this section, we introduce the state-based approach to describe services that will be used in Section 7 to describe services for molecular dynamics.... ..."

### Table 2. Axioms for recursion

2007

"... In PAGE 7: ... This constant is denoted by hXjEi. The additional axioms for recursion are given in Table2 . In this table, we write htXjEi for tX with, for all Y 2 V(E), all occurrences of Y in tX replaced by hY jEi.... ..."

### Table 3. Recursive performance.

2004

Cited by 5

### Table 7. Axioms for recursion

2003

Cited by 1

### Table 20: Recursive expressions.

1994

Cited by 1