Abstract state machines capture parallel algorithms

被引：0

作者：

Blass, Andreas ^{[1
,3
]}

Gurevich, Yuri ^{[2
,4
]}

机构：

[1] University of Michigan

[2] Microsoft Research

[3] Mathematics Department, University of Michigan, Ann Arbor, MI 48109-1109

[4] Microsoft Research, One Microsoft Way, Redmond, WA 98052

来源：

ACM Transactions on Computational Logic | 2003年 / 4卷 / 03期

关键词：

Computational methods - Computer programming languages - Computer simulation - Mathematical models - Parallel processing systems - Parameter estimation;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We give an axiomatic description of parallel, synchronous algorithms. Our main result is that every such algorithm can be simulated, step for step, by an abstract state machine with a background that provides for multisets.

引用

页码：578 / 651