同步并行算法的行为理论——简化并行ASM理论的修正
A Behavioural Thesis of Synchronous Parallel Algorithms -- Correction of the Simplified Parallel ASM Thesis
AI总结:
本文针对同步并行算法提出更简洁的行为理论公设,修正了并行ASM理论的刻画证明,证明并行算法可被ASM捕获。
摘要:
行为理论由三部分构成:与机器无关的公设(刻画特定类别的算法或系统)、可证满足这些公设的抽象机模型,以及严格证明公设规定的任何算法或系统都可被该抽象机模型捕获。本文关注的类别是同步并行算法。Blass和Gurevich已针对该类别提出了一套行为理论,尽管数学上正确,但缺乏说服力,因为无法直观明确这些公设是否真正抓住了(同步)并行算法的本质。本文提出了一套更简单(且可能更具说服力)的同步并行算法的四条公设,它们与Gurevich的顺序ASM理论的公设相近,关键区别在于用多重集 comprehension 项而非基于状态签名的基础项扩展了有界探索公设。此外,所有隐含假设都被明确化,这相当于用元有限一阶结构表示并行算法的状态。本文首先提供证据表明该公理化体系刻画了全部确定性同步并行算法,随后正式证明并行算法可被抽象状态机(ASM)捕获。该证明利用了有界探索公设的要求:更新集需由无等词的一阶公式在见证项确定的有限临界结构中统一可定义,这些公式会被转换为并行ASM规则的守卫。本版本修正了第一版的刻画证明,其关键引理有误;有界探索公设已据此修订。
英文摘要:
A behavioural theory consists of machine-independent postulates characterizing a particular class of algorithms or systems, an abstract machine model that provably satisfies these postulates, and a rigorous proof that any algorithm or system stipulated by the postulates is captured by the abstract machine model. The class of interest in this article is that of synchronous parallel algorithms. For this class a behavioural theory has already been developed by Blass and Gurevich, which, though mathematically correct, fails to be convincing, as it is not intuitively clear that the postulates really capture the essence of (synchronous) parallel algorithms. We present a much simpler (and presumably more convincing) set of four postulates for (synchronous) parallel algorithms, which are close to those of Gurevich's sequential ASM thesis. The key difference is an extension of the bounded exploration postulate using multiset comprehension terms instead of ground terms formulated over the signature of the states. In addition, all implicit assumptions are made explicit, which amounts to representing states of a parallel algorithm by meta-finite first-order structures. The article first provides evidence that the axiomatization characterizes the whole class of deterministic, synchronous, parallel algorithms, then formally proves that parallel algorithms are captured by Abstract State Machines (ASMs). The proof uses the requirement of the bounded exploration postulate that update sets be uniformly definable, by equality-free first-order formulae, in the finite critical structures determined by the witness terms; these formulae are translated into the guards of a parallel ASM rule. This version corrects the characterization proof of the first version, whose key lemma was false; the bounded exploration postulate has been amended accordingly.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。