Update models/Application_examples/Euclids_Algorithm.mp

models/Application_examples/Euclids_Algorithm.mp

@@ -8,7 +8,7 @@
 │*│                                                        │
 │*│ ┌─[ Purpose ]────────────────────────────────────────┐ │
 │*│ │ To use MP to model an adaptation of the well-known │ │
-│*│ │ Greatest Common Divisor Algorithm by Euclid.       │ │
+│*│ │ Greatest Common Divisor (GCD) Algorithm by Euclid. │ │
 │*│ └────────────────────────────────────────────────────┘ │
 │*│                                                        │
 │*│ ┌─[ Description ]────────────────────────────────────┐ │
@@ -21,14 +21,12 @@
 │*│ ┌─[ References ]─────────────────────────────────────┐ │
 │*│ │ Leslie Lamport's Introduction to TLA+              | |
 │*│ │ https://www.newsroom.hlf-foundation.org/newsroom/  | |
-│*│ │ https://www.newsroom.hlf-foundation.org/newsroom/  | |
-|*| | lectures/video/lecture-if-youre-not-writing-a-     | |
-|*| | program-dont-use-a-programming-language.html       | | 
+│*│ │ https://www.newsroom.hlf-foundation.org/newsroom/lectures/video/lecture-if-youre-not-writing-a-program-dont-use-a-programming-language.html
 │*│ └────────────────────────────────────────────────────┘ │
 │*│                                                        │
 │*│ ┌─[ Search Terms ]───────────────────────────────────┐ │
-│*│ │ behavior, Euclid, GCD, Lamport ;                   │ │
-│*│ │ coordination, event; coordination, conditional     │ │
+│*│ │ behavior, Euclid; GCD; Lamport;                    │ │
+│*│ │ coordination, event; ENSURE, conditional           │ │
 │*│ └────────────────────────────────────────────────────┘ │
 │*│                                                        │
 │*│ ┌─[ Instructions ]───────────────────────────────────┐ │