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

vault backup: 2025-04-14 12:24:54

Browse source
This commit is contained in:
Marco Realacci 2025-04-14 12:24:54 +02:00
parent f8d837fa43
commit 85b1570690
1 changed files with 2 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

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

@ -99,7 +99,7 @@ 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 ## A syntax for LTSs
![](../../Pasted%20image%2020250414091521.png) ![](../../Pasted%20image%2020250414091521.png)
@ -107,7 +107,7 @@ Let (p,q) ∈ S. Then, there exists a bisimulation that contains the pair (p, q)
![](../../Pasted%20image%2020250414091528.png) ![](../../Pasted%20image%2020250414091528.png)
The only ingredients we used to write down an LTS are: The only ingredients we used to write down an LTS are:
- sequential compsition (of an action and a process) - sequential composition (of an action and a process)
- non-deterministic choice (between a finite set of prefixed processes) - non-deterministic choice (between a finite set of prefixed processes)
- recursion - recursion