on deadlocks

doc/csp.ipynb

@@ -211,7 +211,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "So does CSP eliminate all deadlocks? No, but almost yes. What we mean is that it is of course possible to have a deadlock in CSP, by for example waiting on a rendezvous that no one else would complete. However, such situations are rather obvious, and if they ever occur in your programs, they are very easy to spot. This is unlike working with locks where you need to be careful on every step. What this means is that CSP is on a much higher level of abstraction than locks and synchronizations. It is no coincidence that working with locks very often feels like doing pointer arithmetics."
+    "So does CSP eliminate all deadlocks? No, but almost yes. What we mean is that it is of course possible to have a deadlock in CSP, by for example waiting on a rendezvous that no one else would complete. However, such situations are rather obvious, and if they ever occur in your programs, they are very easy to spot. You probably won't encounter any deadlocks other than the most obvious and most trivial ones. This is unlike working with locks where you need to be careful on every step. What this means is that CSP is on a much higher level of abstraction than locks and synchronizations. It is no coincidence that working with locks very often feels like doing pointer arithmetics."
    ]
   },
   {