vault backup: 2025-03-10 17:25:21

.obsidian/workspace.json

@@ -34,9 +34,9 @@
               "type": "pdf",
               "state": {
                 "file": "Concurrent Systems/slides/class 3.pdf",
-                "page": 10,
+                "page": 13,
                 "left": -26,
-                "top": 499,
+                "top": 31,
                 "zoom": 0.57541567695962
               },
               "icon": "lucide-file-text",
@@ -218,6 +218,7 @@
   },
   "active": "6edd4157a160e462",
   "lastOpenFiles": [
+    "Pasted image 20250310172134.png",
     "Concurrent Systems/slides/class 3.pdf",
     "Concurrent Systems/notes/3.md",
     "Pasted image 20250310103703.png",

Concurrent Systems/notes/3.md

@@ -229,7 +229,9 @@ unlock(i) :=
 **Theorem:** if $p_i$ is in the CS, then $p_j$ cannot simultaneously be in the CS.
 *Proof:* by contradiction.
 
-...
+Let's consider the execution of $p_i$ leading to its CS:
+![[Pasted image 20250310172134.png]]
+
 
 #### Bounded bypass proof
 **Lemma 1:** exactly after n CSs there is a reset of DATE.