vault backup: 2025-04-30 17:13:22

Concurrent Systems/notes/13 - Weak Bisimilarity.md

@@ -109,4 +109,9 @@ Every component can be in three states:
 - A (waiting for being habilitated to extraction)
 - B (habilitated, with the possibility of being extracted or of habilitating the next component)
 - C (extracted, waiting to externally communicate its value and start the process again): $$A_{i}=a_{i}.B_{i} \quad B_{i}=\tau.C_{i}+\bar{a}_{(i \space mod \space n)+1}.A_{i} \quad C_{i}=\bar{p}_{i}.B_{i}$$
-In pratica ogni volta o estrae di nuovo "se stesso" oppure "abilita" il componente successivo.
+In pratica ogni volta o estrae di nuovo "se stesso" oppure "abilita" il componente successivo.
+
+Implementation: $$Impl \triangleq (B_{1}|A_{2}|\dots|An)$$
+basically we need to have an initially habilitated process, which can be any (the first one in our case).
+
+This will generate the LTS: