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

vault backup: 2025-05-05 09:02:04

Browse source
This commit is contained in:
Marco Realacci 2025-05-05 09:02:04 +02:00
parent 6023957b48
commit aeca70e82d
2 changed files with 4 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

3
.obsidian/workspace.json vendored
View file

@ -213,9 +213,9 @@
},
"active": "cdcc59f1bf6d4ae1",
"lastOpenFiles": [
"Pasted image 20250505085454.png",
"Concurrent Systems/slides/class 15.pdf",
"Concurrent Systems/notes/15 - A formal language for LTSs.md",
"Pasted image 20250505085454.png",
"Pasted image 20250505084741.png",
"Pasted image 20250505084556.png",
"Pasted image 20250505083948.png",
@ -236,7 +236,6 @@
"Concurrent Systems/slides/class 13.pdf",
"Concurrent Systems/notes/images/Pasted image 20250415082906.png",
"Concurrent Systems/slides/class 14.pdf",
"Concurrent Systems/notes/images/Pasted image 20250429092543.png",
"Concurrent Systems/slides/class 12.pdf",
"HCIW/slides/HCI in the car.pdf",
"Concurrent Systems/slides/class 11.pdf",

3
Concurrent Systems/notes/15 - A formal language for LTSs.md
View file

@ -32,3 +32,6 @@ However, this can never happen, whatever P’ be;
hence, P |= ☐aFF holds true only if P cannot perform any action a
![](../../Pasted%20image%2020250505085454.png)
Let us now define the set of formulae satisfied by a process as $$L(P) = \{ \phi \in Form:P \models \phi \}$$
To simplify the proof, let us modify the set of formulae