Studies of issues related to computability and computational complexity involve the use of a model of computation. Central in such a model are computational processes. 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.

与可计算性和计算复杂性相关的问题的研究涉及计算模型的使用。这种模型的核心是计算过程。可以使用基于 ACP（通信进程代数）的命令式进程代数来描述此类进程。本文研究了所涉及的命令过程代数是否可以在计算模型领域发挥作用。事实证明，过程代数适合以数学上精确的方式描述与基于顺序、异步并行和同步并行随机存取机的现有模型相对应的计算模型以及这些模型的时间和工作复杂性度量。