vault backup: 2025-03-04 09:04:45

.obsidian/workspace.json

@@ -36,9 +36,9 @@
               "type": "pdf",
               "state": {
                 "file": "Concurrent Systems/slides/class 2.pdf",
-                "page": 5,
+                "page": 8,
                 "left": -23,
-                "top": 56,
+                "top": 74,
                 "zoom": 0.6796318289786224
               },
               "icon": "lucide-file-text",
@@ -220,6 +220,8 @@
   },
   "active": "802d9ec58484849d",
   "lastOpenFiles": [
+    "Pasted image 20250304090219.png",
+    "Pasted image 20250304090207.png",
     "Pasted image 20250304084901.png",
     "Pasted image 20250304084537.png",
     "Pasted image 20250304082459.png",
@@ -264,8 +266,6 @@
     "Biometric Systems/notes/1. Introduction.md",
     "Biometric Systems/images/Pasted image 20241228171617.png",
     "Biometric Systems/images/Pasted image 20241228174722.png",
-    "Biometric Systems/images/Pasted image 20241217025904.png",
-    "Biometric Systems/images/Pasted image 20241217030157.png",
     "Senza nome.canvas"
   ]
 }

Concurrent Systems/notes/Lezione2.md

@@ -67,4 +67,16 @@ Let $p_i$ invoke lock
 		- let us consider the last of such $p_h \to$ it will eventually win
 	2. In the ∀j.wait FLAG[j] = down
 		- this wait cannot block a process forever
-		- if pj doesn't lock, i
+		- if $pj$ doesn't lock, it flag is down
+		- if $pj$ doesn't find Y at ⊥, it puts its flag down
+		- if pj doesn't find X at j, it puts its flag down, otherwise pj enters its CS and eventually unlocks (flag down)
+	- 3. In the first wait Y = ⊥
+		- since pj read a value different from ⊥, there is at least one pk that wrote Y before (but has not yet unlocked)
+		- if $p_k$ eventually enters its CS -> ok, otherwise it must be blocked forever as well. Where?
+			- ![[Pasted image 20250304090207.png]]
+
+![[Pasted image 20250304090219.png]]
+
+esercizio: prova che NON soddisfa starvation freedom
+
+#### From deadlock freedom to bounded bypass