Studies of issues related to computability and computational complexity involve the use of a model of computation. Pivotal to such a model are the computational processes considered. Processes of this kind can be described using an imperative process algebra based on ACP (Algebra of Communicating Processes). In this paper, it is investigated whether the imperative process algebra concerned can play a role in the field of models of computation.It is demonstrated that the process algebra is suitable to describe in a mathematically precise way models of computation corresponding to existing models based on sequential, asynchronous parallel, and synchronous parallel random access machines as well as time and work complexity measures for those models. A probabilistic variant of the model based on sequential random access machines and complexity measures for it are also described.

翻译：与可计算性和计算复杂性相关的研究涉及计算模型的使用。此类模型的关键在于所考虑的计算过程。这类过程可以使用基于ACP（通信进程代数）的命令式进程代数进行描述。本文研究了该命令式进程代数是否能在计算模型领域发挥作用。研究表明，该进程代数能够以数学精确的方式描述与基于顺序、异步并行和同步并行随机存取机的现有模型相对应的计算模型，以及这些模型的时间与工作复杂度的度量。此外，还描述了基于顺序随机存取机的概率变体模型及其复杂度度量。