A simplified parallel ASM thesis

Authors:
Klaus-Dieter Schewe;Qing Wang
Affiliations:
Software Competence Center Hagenberg, Johannes-Kepler-University, Linz, Austria;Research School of Computer Science, The Australian National University, Australia
Venue:
ABZ'12 Proceedings of the Third international conference on Abstract State Machines, Alloy, B, VDM, and Z
Year:
2012

Citing 4
Cited 0

Sequential abstract-state machines capture sequential algorithms

ACM Transactions on Computational Logic (TOCL)
Abstract state machines capture parallel algorithms

ACM Transactions on Computational Logic (TOCL)
A customised ASM thesis for database transformations

Acta Cybernetica
Synchronous parallel database transformations

FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.