Abstract state machines capture parallel algorithms
Andreas R. Blass, Yuri G. Gurevich · ACM Transactions on Computational Logic · 2003
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.