Abstract state machines capture parallel algorithms

  • Authors:
  • Andreas Blass;Yuri Gurevich

  • Affiliations:
  • University of Michigan, Ann Arbor, MI;Microsoft Research, Redmond, WA

  • Venue:
  • ACM Transactions on Computational Logic (TOCL)
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.