| Citation: | Andreas Blass and Yuri Gurevich, "Abstract State Machines Capture Parallel Algorithms". ACM Transactions on Computation Logic, vol. 4, no. 4, October 2003, 578-651. | ||
|---|---|---|---|
| Summary: | An axiomatic description of parallel, synchronous algorithms. The main result is that every such algorithm can be simulated, step for step, by an ASM with a background that provides for multisets. | ||
| Subjects: | Introductory Materials | ||
| Download: | From Yuri Gurevich's homepage in PDF.
|
Notes:
| Also appears as Microsoft Research Technical Report MSR-TR-2001-117.
See also this correction and
extension.
| |
[an error occurred while processing this directive]
URL:
http://web.eecs.umich.edu/gasm/papers/parallelThesis.html (page only)
last update: Wednesday, 14-Aug-2013 18:19:19 EDT