Imperative process algebra and models of parallel computation

In the theory of computation, a model of computation is used to study issues related to computability and computational complexity. Central in such a model are the computational processes considered. Processes of this kind can be described using an existing imperative process algebra based on ACP (Algebra of Communicating Processes). This paper studies whether this process algebra can play a role in the field of models of computation, in particular in the field of models of parallel computation.