Abstract State Machines Capture Parallel Algorithms

  • Andreas Blass ,
  • Yuri Gurevich

MSR-TR-2001-117 |

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. See also 157-2.