TY - GEN
T1 - A Simplified Parallel ASM Thesis
AU - Schewe, Klaus-Dieter
AU - Wang, Qing
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/84863955925
U2 - 10.1007/978-3-642-30885-7_27
DO - 10.1007/978-3-642-30885-7_27
M3 - Conference proceedings
SN - 9783642308840
VL - 7316
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 341
EP - 344
BT - Abstract State Machines, Alloy, B, VDM, and Z (ABZ 2012)
PB - Springer Berlin Heidelberg
ER -