SASA is a *Self-stabilizing Algorithms SimulAtor*, based on the
so-called *Atomic State model* (ASM) introduced by _Dijkstra_ in its seminal article
so-called *Atomic State model* (ASM)[fn:asm] introduced by _Dijkstra_ in its seminal article
on [[http://www.cs.utexas.edu/~EWD/ewd04xx/EWD426.PDF][Self-stabilizing distributed algorithms]].
[fn:asm] This model is also sometimes named "locally shared memory model with composite atomicity"
Basically, one needs to provide:
1. a topology, made of nodes and transitions (via a [[https://en.wikipedia.org/wiki/DOT_(graph_description_language)][dot]] file)
2. the algorithms attached to nodes (via [[https://ocaml.org/][=ocaml=]] programs)
...
...
@@ -41,11 +43,11 @@ SASA source code: https://gricad-gitlab.univ-grenoble-alpes.fr/verimag/synchrone
Some Tutorials: https://verimag.gricad-pages.univ-grenoble-alpes.fr/vtt/tags/sasa/
TAP article pre-print : [[https://hal.archives-ouvertes.fr/hal-02521149][Karine Altisen, Stéphane Devismes, Erwan Jahier. SASA: a SimulAtor of Self-stabilizing Algorithms. 14th International Conference on Tests and Proofs, Jun 2020, Bergen, Norway. hal-02521149]]
