Within the context of an algebraic theory of processes, an equational specification of process cooperation is provided. Four cases are considered: free merge or interleaving, merging withâ€¦ (More)

We describe an axiom system ACP p that incorporates real timed actions. Many examples are provided in order to explain the intuitive contents of the notation. ACP p is a generalisation of ACP. Thisâ€¦ (More)

Algebraic specifications of abstract data types can often be viewed as systems of rewrite rules. Here we consider rewrite rules with conditions, such as they arise, e.g., from algebraicâ€¦ (More)

This paper is concerned with finding complete axiomatizations of probabilistic processes. We examine this problem within the context of the process algebra ACP and obtain as our end-result the axiomâ€¦ (More)

The axiom system ACP of [BeK84a] was extended with real time features in [BaB91]. Here we proceed to define a discrete time extension of ACP, along the lines of ATP [NiS94]. We present versions basedâ€¦ (More)

A context-free grammar (CFG) in Greibach Normal Form coincides, in another notation, with a system of guarded recursion equations in Basic Process .$dgebrzd. Hence, to each CFG, aprocess can beâ€¦ (More)

We construct a graph model for ACP,, the algebra of communicating processes w%h silent steps, in which Koomenâ€™s Fair Abstraction Rule (KFAR) holds, and also versions of the Approximation Inductionâ€¦ (More)