doc: say where the asynchronous unison comes from

test/README.org

@@ -11,28 +11,29 @@ Self-Stabilizing Algorithms'' By Altisen, Devismes, Dubois, and Petit.
 1. =test/skeleton/=: a fake algorithm meant to be used as a skeleton
 2. =test/dijkstra-ring/=: Dijkstra token ring
 3. =test/unison/=: Synchronous unison
-4. =test/async-unison/=: Asynchronous unison
-5. =test/coloring/=: a graph coloring algorithm
-6. =test/alea-coloring/=: a randomized variant of the previous one
-7. =test/bfs-spanning-tree/=:  a  Breadth  First Search  Spanning  tree
+4. =test/coloring/=: a graph coloring algorithm
+5. =test/alea-coloring/=: a randomized variant of the previous one
+6. =test/bfs-spanning-tree/=:  a  Breadth  First Search  Spanning  tree
    construction
 
 It  also   contains  implementations   of  algorithms  found   in  the
 literature:
-1. =test/st-CYH91=:    another   Spanning    tree   construction    ("A
+1. =test/async-unison/=: Asynchronous unison ("Asynchronous
+   unison" by Couvreur,  J., Francez, N.,  and Gouda, M. G. in 1992)
+2. =test/st-CYH91=:    another   Spanning    tree   construction    ("A
    self-stabilizing algorithm for constructing spanning trees" by Chen,
    Yu, and Huang in 1991)
-2. =test/bfs-st-HC92=:  another  BFS  Spanning tree  construction  ("A
+3. =test/bfs-st-HC92=:  another  BFS  Spanning tree  construction  ("A
    self-stabilizing algorithm for  constructing breadth-first trees" by
     Huang and Chen in 1992)
-3. =test/st-KK06_algo1= and =test/st-KK06_algo2=: another Spanning tree
+4. =test/st-KK06_algo1= and =test/st-KK06_algo2=: another Spanning tree
    construction ("A  Self-stabilizing Algorithm for Finding  a Spanning
    Tree in a Polynomial Number of Moves" by Kosowski and Kuszner, 2006)
-4. =test/dfs/=: a Depth  First Search using arrays  (the ``atomic state
+5. =test/dfs/=: a Depth  First Search using arrays  (the ``atomic state
    model'' version of a [[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.57.1100&rep=rep1&type=pdf][Depth First Search algorithm proposed by Collin and Dolev in 1994]])
-5. =test/dfs-list/=:  the same  Depth First  Search, but  using lists
+6. =test/dfs-list/=:  the same  Depth First  Search, but  using lists
   instead or arrays
-6. =test/rsp-tree/=: The Algorithm 1 of "Self-Stabilizing Disconnected
+7. =test/rsp-tree/=: The Algorithm 1 of "Self-Stabilizing Disconnected
    Components Detection  and Rooted Shortest-Path Tree  Maintenance in
    Polynomial  Steps" by  Stéphane Devismes,  David Ilcinkas,  Colette
    Johnen.

test/async-unison/p.ml

-(* Time-stamp: <modified the 05/03/2020 (at 20:33) by Erwan Jahier> *)
+(* Time-stamp: <modified the 14/04/2022 (at 17:23) by Erwan Jahier> *)
 
+(* Couvreur,  J., Francez, N.,  and Gouda, M. G.  (1992) Asynchronous
+   unison (extended abstract). Proceedings  of the 12th International
+   Conference on Distributed Computing Systems, Yokohama, Japan, June
+   9-12, pp.  486–493. IEEE Computer Society.  *)
 open Algo
 
 let n = Algo.card()