命令式进程代数与计算模型
Imperative process algebra and models of computation
AI总结：
本文研究基于ACP的命令式进程代数在计算模型领域的作用，证明其可精确描述多种随机存取机对应的计算模型及复杂度度量，还给出了顺序模型的概率变体。
摘要：
可计算性与计算复杂性相关问题的研究需要用到计算模型，这类模型的核心是所考虑的计算进程，这类进程可使用基于ACP（通信进程代数）的命令式进程代数来描述。本文研究了相关命令式进程代数能否在计算模型领域发挥作用。研究证明，该进程代数适合以数学上精确的方式描述与现有基于顺序、异步并行和同步并行随机存取机的计算模型相对应的模型，以及这些模型的时间和工作复杂性度量。本文还描述了基于顺序随机存取机的模型的概率变体及其复杂性度量。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
