vault backup: 2025-04-14 09:34:56

.obsidian/workspace.json

@@ -238,10 +238,11 @@
       "companion:Toggle completion": false
     }
   },
-  "active": "364a7591f14f033a",
+  "active": "fbeaa35cc5a8abf1",
   "lastOpenFiles": [
-    "Concurrent Systems/notes/11 - LTSs and Bisimulation.md",
+    "Pasted image 20250414093017.png",
     "Concurrent Systems/slides/class 11.pdf",
+    "Concurrent Systems/notes/11 - LTSs and Bisimulation.md",
     "Pasted image 20250414092202.png",
     "Concurrent Systems/slides/class 12.pdf",
     "Pasted image 20250414091528.png",

Concurrent Systems/notes/11 - LTSs and Bisimulation.md

@@ -128,3 +128,10 @@ If the index set $I$ is empty, then $\sum_{i\in I} \alpha_{i}.P_{i}$ is the term
 
 We shall usually omit tail occurrences of ‘.0’ and, for example, simply write a.b instead of a.b.0
 
+### From the syntax to the LTS
+From the syntax to the LTS We have shown how it is possible, starting from an LTS, to generate a corresponding process
+
+It is also possible the inverse translation and then the two formalisms do coincide; the rules that have to be used in this translation are:
+![](../../Pasted%20image%2020250414093017.png)
+
+