A process creation mechanism in process algebra
Jan Aldert Bergstra · Cambridge University Press eBooks · 1990
We introduce an encapsulation operator E φ that provides process algebra with a process creation mechanism. Several simple examples are considered. It is shown that E φ does not extend the defining power of the system ‘ACP with guarded recursion’. INTRODUCTION Extension of process algebra In this paper we extend process algebra with a new operator that will be helpful to describe process creation. From a methodological point of view the extension of process algebra with new operators is just the right way to incorporate new features. Only in a very rich calculus with many operators one may hope to be able to perform significant algebraic calculations on systems. In many cases a new feature requires new (additional) syntax and more equations, only in very rare circumstances the addition of equations alone suffices to obtain an appropriate model of some new system aspect. The core system ACP, see, describes asynchronous cooperation with synchronous communication. On top of ACP various features can be added, for instance: asynchronous communication , cooperation in the presence of shared data , broadcasting , interrupts . This note adds process creation to the features that are compatible with process algebra. For historical remarks and relations with previous literature we refer to. Process creation We start on basis of the axiom system ACP which is supposed to be known to the reader. We assume the presence of a finite set of data D and introduce for each d ∈ D an action cr(d) . The action cr(d) stands for: create a process on basis of initial information d . Let cr(D) denote the set { cr(d) | d ∈ D }.