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

2025-04-14 09:19:56 +02:00 · 2025-04-14 09:19:56 +02:00 · 642f3b482e
commit 642f3b482e
parent eefe22e6ca
4 changed files with 15 additions and 5 deletions
--- a/Systems/notes/11
+++ b/Systems/notes/11
@ -100,3 +100,13 @@ So, (p', q') ∈ ∼
 *Proof:*
 Let (p,q) ∈ S. Then, there exists a bisimulation that contains the pair (p, q); thus, (p, q) ∈ ∼.

+![](../../Pasted%20image%2020250414091521.png)
+
+
+![](../../Pasted%20image%2020250414091528.png)
+
+The only ingredients we used to write down an LTS are:
+- sequential compsition (of an action and a process)
+- non-deterministic choice (between a finite set of prefixed processes)
+- recursion
+