vault backup: 2025-04-15 09:10:18

Concurrent Systems/notes/13 - CCS cose varie.md

@@ -55,4 +55,10 @@ where C is a context (i.e., a process with a hole ☐), P is a process, and $C[P
 
 Example: $$if \space C = (☐ | Q) \textbackslash a, \space then \space C[P] = (P | Q) \textbackslash a$$
 The set C of CCS contexts is given by the following grammar:
-$$C ::= ☐ \space | \space C|P \space | $$
+$$C ::= ☐ \space | \space C|P \space | \space C \textbackslash a \space | \space a.C + M$$
+where M denotes a sum.
+
+An equivalence relation $R$ is a congruence if and only if
+$$\forall (P, Q) \in R, \forall C.(C[P], C[Q]) \in R$$
+Is bisimilarity a congruence? Yes.
+$$$$