marcorealacci/master-degree-notes
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

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

Browse source
This commit is contained in:
Marco Realacci 2025-04-15 09:10:18 +02:00
parent 8dd45af905
commit 8b70e07800
1 changed files with 7 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

8
Concurrent Systems/notes/13 - CCS cose varie.md
View file

@ -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$$ 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: 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.
$$$$