diff --git a/Concurrent Systems/notes/14 Checking bisimilarity, an inference system.md b/Concurrent Systems/notes/14 Checking bisimilarity, an inference system.md
index 730bbcb..896e741 100644
--- a/Concurrent Systems/notes/14 Checking bisimilarity, an inference system.md	
+++ b/Concurrent Systems/notes/14 Checking bisimilarity, an inference system.md	
@@ -79,7 +79,7 @@ exercise: prove the weak bisimilarity between the spec and the implementation.
 Let us consider the parallel of processes M and R, by using the axiom for parallel, we have $$\vdash M|R=put.(\overline{go}|R)+go.(M|\overline{rcv})$$
 By using the same axiom to the parallel of the three processes, we obtain
 $$\vdash S|(M|R)=send.(\overline{put}|(M|R))+put.(\overline{go}|R|S)+go.(\overline{rcv}|S|M)$$
-By restricting *put* and *go*, and by using the second axiom for restriction, we have that:
+By restricting *put* and *go*, and by using the second axiom for restriction, we have that (spostiamo la res):
 ![](images/Pasted%20image%2020250429091959.png)
 
 We now apply the third axiom for restriction to the three summands: