Process algebra with action dependencies

In this paper, we present a process algebra with a minimal form of semantics for actions given by dependencies. Action dependencies are interpreted in the Mazurkiewicz sense: independent actions should be able to commute, or (from a different perspective) should be unordered, whereas dependent actions are always ordered. In this approach, the process algebra operators are used to describe the conceptual behavioural structure of the system, and the action dependencies determine the minimal necessary orderings and thereby the additionally possible parallelism within this structure.

In previous work on the semantics of specifications using Mazurkiewicz dependencies, the main interest has been on linear time. We present in this paper a branching time semantics, both operationally and denotationally. For this purpose, we introduce a process algebra that incorporates, besides some standard operators, also an operator for action refinement. For interpreting the operators in the presence of action dependencies, a new concept of partial termination has to be developed. We show consistency of the operational and denotational semantics; furthermore, we give a axiomatisation of bisimilarity, which is complete for finite terms. Some small examples demonstrate the flexibility of this process algebra in the design of distributed reactive systems.

Authors and Affiliations

1. Department of Computer Science, University of Twente, The Netherlands (e-mail: rensink@cs.utwente.nl), , , , , , NL

   Arend Rensink

2. Abteilung Semantik, Fachbereich Informatik, Universität Oldenburg, Postfach 2503, 26111 Oldenburg, Germany (e-mail: wehrheim@informatik.uni-oldenburg.de), , , , , , DE

   Heike Wehrheim

Received: 19 November 1998 / 18 July 2001

Reprints and permissions