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). In this paper, it is studied whether this imperative process algebra can play a role in the field of models of computation, in particular in the field of models of parallel computation. The study is carried out by using the process algebra to describe models of computation corresponding to existing models based on (sequential) random access machines, asynchronous parallel random access machines, synchronous parallel random access machines, and time and work complexity measures for those models in a mathematically precise way.