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

vault backup: 2025-04-14 09:34:56

Browse source
This commit is contained in:
Marco Realacci 2025-04-14 09:34:56 +02:00
parent fb9063fc06
commit b15aac7bb9
3 changed files with 10 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

5
.obsidian/workspace.json vendored
View file

@ -238,10 +238,11 @@
"companion:Toggle completion": false "companion:Toggle completion": false
} }
}, },
"active": "364a7591f14f033a", "active": "fbeaa35cc5a8abf1",
"lastOpenFiles": [ "lastOpenFiles": [
"Concurrent Systems/notes/11 - LTSs and Bisimulation.md", "Pasted image 20250414093017.png",
"Concurrent Systems/slides/class 11.pdf", "Concurrent Systems/slides/class 11.pdf",
"Concurrent Systems/notes/11 - LTSs and Bisimulation.md",
"Pasted image 20250414092202.png", "Pasted image 20250414092202.png",
"Concurrent Systems/slides/class 12.pdf", "Concurrent Systems/slides/class 12.pdf",
"Pasted image 20250414091528.png", "Pasted image 20250414091528.png",

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

@ -128,3 +128,10 @@ If the index set $I$ is empty, then $\sum_{i\in I} \alpha_{i}.P_{i}$ is the term
We shall usually omit tail occurrences of ‘.0’ and, for example, simply write a.b instead of a.b.0 We shall usually omit tail occurrences of ‘.0’ and, for example, simply write a.b instead of a.b.0
### From the syntax to the LTS
From the syntax to the LTS We have shown how it is possible, starting from an LTS, to generate a corresponding process
It is also possible the inverse translation and then the two formalisms do coincide; the rules that have to be used in this translation are:
![](../../Pasted%20image%2020250414093017.png)

BIN
Pasted image 20250414093017.png Normal file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 72 KiB