From f0332f2b7b73deb40a008628237bac3594a75b1f Mon Sep 17 00:00:00 2001 From: Marco Realacci Date: Tue, 8 Apr 2025 10:51:20 +0200 Subject: [PATCH] vault backup: 2025-04-08 10:51:20 --- Concurrent Systems/notes/11 - LTSs and Bisimulation.md | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/Concurrent Systems/notes/11 - LTSs and Bisimulation.md b/Concurrent Systems/notes/11 - LTSs and Bisimulation.md index 6bc6280..5e65655 100644 --- a/Concurrent Systems/notes/11 - LTSs and Bisimulation.md +++ b/Concurrent Systems/notes/11 - LTSs and Bisimulation.md @@ -53,4 +53,5 @@ Two states q and p are bisimulation equivalent (or, simply, bisimilar) if there ![](../../Pasted%20image%2020250408094749.png) q0 is simulated by p0; this is shown by the following simulation relation: $$S = \{(q0,p0), (q1,p1), (q2,p1), (q3,p2), (q4,p3)\}$$ To let p0 be simulated by q0, we should have that p1 is simulated by q1 or q2. -If S contained one among (p1,q1) or (p1,q2), then it would not be a simulation: indeed, p1 can perform both a c (whereas q1 cannot) and a b (whereas q2 cannot) \ No newline at end of file +If S contained one among (p1,q1) or (p1,q2), then it would not be a simulation: indeed, p1 can perform both a c (whereas q1 cannot) and a b (whereas q2 cannot). +