### Table 5: The ACP -axioms of combinatory process algebra.

"... In PAGE 7: ... 2 The second group of axioms consists of the ACP -axioms introduced in [BK85] and extending the ACP-axioms of [BK84]. The schemata, from which the axioms can be obtained by a type assignment to the variables and operators, are listed in Table5 . They di er from all the other schemata in so far as only restricted type assignment is permitted.... In PAGE 24: ... It should be clear that the axioms of argumentwise evaluation (Table 4) are satis ed under this interpretation. Moreover, as BP is a model of the ACP -axioms ( Table5 ), the SEI-axioms (Table 6), the -axioms (Table 7) and the jF-axioms (Table 8) restricted to type P, it follows by induction on type formation, that the higher-order typed axioms hold in M. So, M is a model for combinatory... ..."

### Table 41: Signatures of some process algebras.

1996

"... In PAGE 127: ... A.1 Signatures In Table41 we give the signature of some process algebras, among which all those treated... ..."

Cited by 7

### Table 41: Signatures of some process algebras.

1996

"... In PAGE 127: ... A.1 Signatures In Table41 we give the signature of some process algebras, among which all those treated... ..."

Cited by 7

### Table 41: Signatures of some process algebras.

1996

"... In PAGE 127: ... A.1 Signatures In Table41 we give the signature of some process algebras, among which all those treated... ..."

Cited by 7

### Table 43: Overview of axioms of concurrent process algebras.

1996

"... In PAGE 131: ... We have the following legend: A indicates that the axiom is present in the theory, A indicates that the axiom is not present but can be derived (for closed terms) from the other axioms in the theory, A indicates that the axiom does not hold in the theory, A indicates that the axiom is meaningless in the theory, as there is a signature conflict. In Table43 on page 135 we give an overview of the axioms pertaining to merge operators of the (concurrent) process algebras treated in Section 3. The legend is the same as for the previous table.... ..."

Cited by 7

### Table 1: Basic process algebra with autonomous actions

1995

"... In PAGE 2: ...ur basic algebra BPAaa is an extensionof BPA : basic process algebra with inaction (c.f. [BaWe90]). The signature and axioms are given in Table1 . First, in the header, the sort of atoms (A) is declared, which is a parameter of the theory.... In PAGE 2: ... The I axioms (for inequality ) state that unstable nondeterminism may be reduced in an implemen- tation. The algebra BPAaa is obtained from BPAaa by removing these inequalities from the axioms in Table1 . Note that BPAaa with atoms A equals BPA with atoms AC.... ..."

Cited by 2

### Table 1: BPA (Basic Process Algebra)

2005

"... In PAGE 1: ... We mainly raise questions and are not yet able to present significant answers. 1 Periodic Processes Our point of departure is the axiom system BPA in Table1 together with guarded recursion.... ..."

### Table 1: Informal relationships to Notions in Process Algebra

1998

"... In PAGE 30: ... This enables us to handle open expressions, but the proof technique fails to be complete (for example, it cannot prove that any pair of weak head normal forms are equivalent). We summarise some informal correspondences between the notions in process calculus and the relations defined in this article in Table1 . Our attempts to complete this picture find a more exact correspondence between the proof techniques relating to bisimulation up to improvement and contexthave so far been unsuccessful.... ..."

Cited by 10

### Table 1: Informal relationships to Notions in Process Algebra

"... In PAGE 30: ... This enables us to handle open expressions, but the proof technique fails to be complete (for example, it cannot prove that any pair of weak head normal forms are equivalent). We summarise some informal correspondences between the notions in process calculus and the relations defined in this article in Table1 . Our attempts to complete this picture find a more exact correspondence between the proof techniques relating to bisimulation up to improvement and contexthave so far been unsuccessful.... ..."

### Table 1. BPA (Basic Process Algebra), left, and PA (Process Algebra), on the right

"... In PAGE 1: ... A typical example is the process Stack. It can be defined by a finite recur- sive specification over BPA (for the axioms of BPA see Table1 ), but not by a star Supported by the Netherlands Organisation for Scientific Research NWO in project GeoProc( Geometry of Processes , Nr.... ..."