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

vault backup: 2025-04-08 09:41:02

Browse source
This commit is contained in:
Marco Realacci 2025-04-08 09:41:02 +02:00
parent 7f58845b20
commit 8fd95be1b5
3 changed files with 7 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

@ -37,3 +37,7 @@ In concurrency theory, we don’t use finite automata but Labeled Transition Sys
We shall usually write s –a–> s′ instead of ⟨s,a,s′⟩ ∈ T.
### Bisimulation
Intuitively, two states are equivalent if they can perform the same actions that lead them in states where this property still holds
![](../../Pasted%20image%2020250408093840.png)
P0 and Q0 are different because, after an a, the former can decide to do b or c, whereas the latter must decide this before performing a.