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

vault backup: 2025-04-14 12:19:53

Browse source
This commit is contained in:
Marco Realacci 2025-04-14 12:19:53 +02:00
parent ea5cb2e776
commit f8d837fa43
1 changed files with 0 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

1
Concurrent Systems/notes/11 - LTSs and Bisimulation.md
View file

@ -99,7 +99,6 @@ So, (p', q') ∈ ∼
**Theorem:** For every bisimulation S, it holds that S ⊆ ∼. **Theorem:** For every bisimulation S, it holds that S ⊆ ∼.
*Proof:* *Proof:*
Let (p,q) ∈ S. Then, there exists a bisimulation that contains the pair (p, q); thus, (p, q) ∈ ∼. Let (p,q) ∈ S. Then, there exists a bisimulation that contains the pair (p, q); thus, (p, q) ∈ ∼.
## La parte difficile ## La parte difficile
![](../../Pasted%20image%2020250414091521.png) ![](../../Pasted%20image%2020250414091521.png)