A Simplified Parallel ASM Thesis
We present an idea how to simplify Gurevich’s parallel ASM thesis. The key idea is to modify only the bounded exploration postulate from the sequential ASM thesis by allowing also non-ground comprehension terms. The idea arises from comparison with work on ASM foundations of database transformations.
KeywordsAbstract State Machine bounded exploration synchronous parallelism
Unable to display preview. Download preview PDF.