Within the context of an algebraic theory of processes, an equational specification of process cooperation is provided and some relationships are shown to hold between the four concepts of merging.Expand

The system is an extension of ACP, Algebra of Communicating Processes, with Milner's τ-laws and an explicit abstraction operator, and syntactic properties such as consistency and conservativity over ACP are proved.Expand

This work considers rewrite rules with conditions, such as they arise, e.g., from algebraic specifications with positive conditional equations, for left-linear, nonambiguous TRSs, and proves confluence results and termination results for some well-known reduction strategies.Expand

An algebra of programs, denoted PGA, is outlined, which captures the crux of sequential programming and single out a behavior extraction operator which assigns to each program a behavior.Expand

A mechanism is introduced to describe priorities in ACP, the algebra of communicating processes, whereby some actions have priority over others in a non-deterministic choice (or sum). This mechanism… Expand

An axiom system ACPp is described that incorporates real timed actions that explains its operational meaning in an algebraic form and can be recovered as a special case from ACP.Expand

This paper obtains the axiom system prACP I −- , a probabilistic version of ACP which can be used to reason algebraically about the reliability and performance of concurrent systems.Expand

A graph model for ACP τ is constructed, in which Koomen's Fair Abstraction Rule (KFAR) holds, and also versions of the Approximation Induction Principle (AIP) and the Recursive Definition & Specification Principles (RDP&RSP).Expand