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

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

Browse source
This commit is contained in:
Marco Realacci 2025-04-15 09:45:18 +02:00
parent 087ff94379
commit 6da7c4b084
2 changed files with 5 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

4
.obsidian/workspace.json vendored
View file

@ -226,10 +226,10 @@
"companion:Toggle completion": false "companion:Toggle completion": false
} }
}, },
"active": "46d9dfa1750fc4db", "active": "9d3f25b0eb9b478f",
"lastOpenFiles": [ "lastOpenFiles": [
"Concurrent Systems/notes/13 - CCS cose varie.md",
"Concurrent Systems/slides/class 12.pdf", "Concurrent Systems/slides/class 12.pdf",
"Concurrent Systems/notes/13 - CCS cose varie.md",
"Pasted image 20250415090109.png", "Pasted image 20250415090109.png",
"Concurrent Systems/notes/12 - Calculus of communicating system.md", "Concurrent Systems/notes/12 - Calculus of communicating system.md",
"Pasted image 20250415082906.png", "Pasted image 20250415082906.png",

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

@ -65,3 +65,5 @@ Is bisimilarity a congruence? Yes.
$$if \space P ∼ Q \space then \space \forall C.C[P] ∼ C[Q]$$ $$if \space P ∼ Q \space then \space \forall C.C[P] ∼ C[Q]$$
Proof on the slides. Proof on the slides.
So today we learned that bisimulation is a good equivalence.