### Table 3. Structural congruence relation of the -calculus.

1998

Cited by 11

### Table 4: Structural Rules of Calculus QHLU for Quan-

1995

Cited by 4

### Table 9. Structural congruence on the Join calculus.

2007

Cited by 1

### Table 1 (continued): Molecular and constitutional formula, computational aspects, and results obtained for the ten example compounds

2002

"... In PAGE 10: ... Finally all structures were ranked starting with the lowest RMSD value. Table1 shows the selected compounds, gives some detail of the MOLGEN and ANALYZE runs and presents their results. The structure generation with MOLGEN 3.... In PAGE 10: ... The ANALYZE calculations were performed on 12 PC equipped with two 1GHz Pentium III processors with 1GB main memory running in a cluster under Linux. The computation time for ANALYZE given in Table1 includes reading and writing as well as the additional data handling. The time necessary for the computation of ... In PAGE 11: ...Table1 : Molecular and constitutional formula, computational aspects, and results obtained for the ten example compounds Compound Computation Shift comparison Nr Name Mole- cular formula Constitu- tional formula Number of generated structures Time MOLGEN (s) Time ANALYZE (s) Best/ correct RMSD (ppm) 2nd best RMSD (ppm) Worst RMSD (ppm) Distribution of 13C NMR chemical shift RMSD values (ppm) 1 Methoxyethyl acrylate C6H10O3 O O O 23 838 gt;1 412 0.52 1.... ..."

### Table 1: Design Aspects of Structural Patterns

2000

"... In PAGE 8: ... A designer can use these aspects to help determine which is the most appropriate pattern for a particular situation. Table1 lists the design aspect(s)... ..."

Cited by 2

### Table 1: Molecular and constitutional formula, computational aspects, and results obtained for the ten example compounds

2002

"... In PAGE 10: ... Finally all structures were ranked starting with the lowest RMSD value. Table1 shows the selected compounds, gives some detail of the MOLGEN and ANALYZE runs and presents their results. The structure generation with MOLGEN 3.... In PAGE 10: ... The ANALYZE calculations were performed on 12 PC equipped with two 1GHz Pentium III processors with 1GB main memory running in a cluster under Linux. The computation time for ANALYZE given in Table1 includes reading and writing as well as the additional data handling. The time necessary for the computation of ... In PAGE 12: ...Table1 (continued): Molecular and constitutional formula, computational aspects, and results obtained for the ten example compounds Compound Computation Shift comparison Nr Name Mole- cular formula Constitu- tional formula Number of generated structures Time MOLGEN (s) Time ANALYZE (s) Best/ correct RMSD (ppm) 2nd best RMSD (ppm) Worst RMSD (ppm) Distribution of 13C NMR chemical shift RMSD values (ppm) 4 N-Allyl-N apos;- ethylthiourea C6H12N2S C6H14N2S C6H16N2S N H N H S 709 259 41 8 213 0.70 1.... ..."

### Table 4. Reduction rules of the -calculus.

1998

"... In PAGE 11: ... The terms 9yE and x: ~ y=E bind y and ~ y, respectively; we write fv(E) for all names in E which are not bound.The formal semantics of the -calculus is given by a structural congruence in Table 3 and reduction rules in Table4 . Again structurally congruent terms are considered the same, i.... ..."

Cited by 11

### Table 2: The transition system for the -calculus

1998

"... In PAGE 18: ... Also, is the composition of the two substitutions, in which is applied rst; therefore P is (P ) . The operational semantics of the calculus is de ned by the transition rules of Table2 . The silent action P ?! Q has the same meaning as in CCS.... In PAGE 25: ... Normalised replications can be given the simple transition rule rep-nor: :P ?! P0 ! :P ?! P0 j ! : P or, alternatively, the two rules rep-inp: ! a(x): P ab ?! Pfb=xg j ! a(x): P rep-pre: ! : P ?! P j ! : P ; if is not an input Remark 6.2 As an aside, we wish to point out that rule rep-nor (as well as rep-inp and rep-pre) preserves the following pleasant property of -calculus transition system in Table2 , and which we state here very informally: If two inference proofs of transitions P ?! P0 and P ?! P00 consume the same pre x(es) of P, then P0 and P00 are syntactically the same (up to alpha conversion). This is a handy property to have, for instance when examining the set of derivatives of a process, because it makes it easier to reason by structural induction on processes.... ..."

Cited by 53

### Table 2: The transition system for the -calculus

1998

"... In PAGE 18: ... Also, is the composition of the two substitutions, in which is applied rst; therefore P is (P ) . The operational semantics of the calculus is de ned by the transition rules of Table2 . The silent action P ?! Q has the same meaning as in CCS.... In PAGE 24: ... Normalised replications can be given the simple transition rule rep-nor: :P ?! P0 ! :P ?! P0 j ! : P or, alternatively, the two rules rep-inp: ! a(x): P ab ?! Pfb=xg j ! a(x): P rep-pre: ! : P ?! P j ! : P ; if is not an input Remark 6.2 As an aside, we wish to point out that rule rep-nor (as well as rep-inp and rep-pre) preserves the following pleasant property of -calculus transition system in Table2 , and which we state here very informally: If two inference proofs of transitions P ?! P0 and P ?! P00 involve the same pre x(es) of P, then P0 and P00 are syntactically the same (up to alpha conversion). This is a handy property to have, for instance when examining the set of derivatives of a process, because it makes it easier to reason by structural induction on processes.... ..."

Cited by 53