Distributed ASM - Pitfalls and Solutions

Abstract

While sequential Abstract State Machines (ASM) capture the essence of sequential computation, it is not clear that this is true of distributed ASM. This paper looks at two kinds of distributed process, one based on a global state and one based on variable access. Their commonalities are extracted and conclusions for the general understanding of distributed computation are drawn, providing integration between global state and variable access.

Document

If you cannot see the document below, the PDF document is most likely not freely accessible. In this case, please try to access the document via this link.

Reference

% BibTex
@inproceedings{PrinzS14,
  author       = {Andreas Prinz and
                  Edel Sherratt},
  editor       = {Yamine A{\"{\i}}t Ameur and
                  Klaus{-}Dieter Schewe},
  title        = {Distributed {ASM} - Pitfalls and Solutions},
  booktitle    = {Abstract State Machines, Alloy, B, TLA, VDM, and {Z} - 4th International
                  Conference, {ABZ} 2014, Toulouse, France, June 2-6, 2014. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8477},
  pages        = {210--215},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-662-43652-3\_18},
  doi          = {10.1007/978-3-662-43652-3\_18},
  timestamp    = {Sat, 30 Sep 2023 09:34:45 +0200},
  biburl       = {https://dblp.org/rec/conf/asm/PrinzS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}