A Simplified Parallel ASM Thesis

  • Klaus-Dieter Schewe
  • Qing Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7316)

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.

Keywords

Abstract State Machine bounded exploration synchronous parallelism 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Blass, A., Gurevich, Y.: Abstract state machines capture parallel algorithms. ACM Transactions on Computational Logic 4(4), 578–651 (2003)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Gurevich, Y.: Sequential abstract state machines capture sequential algorithms. ACM Transactions on Computational Logic 1(1), 77–111 (2000)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Schewe, K.D., Wang, Q.: A customised ASM thesis for database transformations. Acta Cybernetica 19(4), 765–805 (2010)MathSciNetMATHGoogle Scholar
  4. 4.
    Schewe, K.D., Wang, Q.: XML database transformations. Journal of Universal Computer Science 16(20), 3043–3072 (2010)MATHGoogle Scholar
  5. 5.
    Schewe, K.-D., Wang, Q.: Synchronous Parallel Database Transformations. In: Lukasiewicz, T., Sali, A. (eds.) FoIKS 2012. LNCS, vol. 7153, pp. 370–383. Springer, Heidelberg (2012)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Klaus-Dieter Schewe
    • 1
  • Qing Wang
    • 2
  1. 1.Software Competence Center HagenbergJohannes-Kepler-UniversityLinzAustria
  2. 2.Research School of Computer ScienceThe Australian National UniversityAustralia

Personalised recommendations