From f8d837fa43797307ffdf171465efad444369e01a Mon Sep 17 00:00:00 2001 From: Marco Realacci Date: Mon, 14 Apr 2025 12:19:53 +0200 Subject: [PATCH] vault backup: 2025-04-14 12:19:53 --- Concurrent Systems/notes/11 - LTSs and Bisimulation.md | 1 - 1 file changed, 1 deletion(-) diff --git a/Concurrent Systems/notes/11 - LTSs and Bisimulation.md b/Concurrent Systems/notes/11 - LTSs and Bisimulation.md index b26a90a..1df2007 100644 --- a/Concurrent Systems/notes/11 - LTSs and Bisimulation.md +++ b/Concurrent Systems/notes/11 - LTSs and Bisimulation.md @@ -99,7 +99,6 @@ So, (p', q') ∈ ∼ **Theorem:** For every bisimulation S, it holds that S ⊆ ∼. *Proof:* Let (p,q) ∈ S. Then, there exists a bisimulation that contains the pair (p, q); thus, (p, q) ∈ ∼. - ## La parte difficile ![](../../Pasted%20image%2020250414091521.png)