diff --git a/Concurrent Systems/notes/1 - CS Basics.md b/Concurrent Systems/notes/1 - CS Basics.md
index dd9e716..9c0a1ce 100644
--- a/Concurrent Systems/notes/1 - CS Basics.md	
+++ b/Concurrent Systems/notes/1 - CS Basics.md	
@@ -101,9 +101,9 @@ Every solution to a problem should satisfy at least:
 **Both inclusions are strict:**
 $$\text{Deadlock freedom} \not \implies \text{Starvation freedom}$$
 	![[Pasted image 20250303093116.png]]
-
-Starvation freedom $\not \implies$ Bounded bypass
-	Assume a $f$ and consider the scheduling above, where p2 wins $f(3)$ times and so does p3, then p1 looses (at least) $2f(3)$ times before winning.
+	*p1 is starving!*
+$$\text{Starvation freedom} \not \implies \text{Bounded bypass}$$
+Assume a $f$ and consider the scheduling above, where p2 wins $f(3)$ times and so does p3, then p1 looses (at least) $2f(3)$ times before winning.
 
 ### Atomic R/W registers
 We will consider different computational models according to the available level of atomicity of the operations provided.