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

vault backup: 2025-04-15 08:25:18

Browse source
This commit is contained in:
Marco Realacci 2025-04-15 08:25:18 +02:00
parent c5a6226854
commit af433ed426
2 changed files with 49 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

45
.obsidian/workspace.json vendored
View file

@ -6,9 +6,10 @@
{ {
"id": "ceb8ca67f2b32f40", "id": "ceb8ca67f2b32f40",
"type": "tabs", "type": "tabs",
"dimension": 42.76504297994269,
"children": [ "children": [
{ {
"id": "84845736e00d5c98", "id": "fc3ff5f9792d4a40",
"type": "leaf", "type": "leaf",
"state": { "state": {
"type": "markdown", "type": "markdown",
@ -20,6 +21,40 @@
"icon": "lucide-file", "icon": "lucide-file",
"title": "12 - Calculus of communicating system" "title": "12 - Calculus of communicating system"
} }
},
{
"id": "9d3f25b0eb9b478f",
"type": "leaf",
"state": {
"type": "markdown",
"state": {
"file": "Concurrent Systems/notes/13 -.md",
"mode": "source",
"source": false
},
"icon": "lucide-file",
"title": "13 -"
}
}
],
"currentTab": 1
},
{
"id": "7fb7c9cd25b3003c",
"type": "tabs",
"dimension": 57.23495702005731,
"children": [
{
"id": "46d9dfa1750fc4db",
"type": "leaf",
"state": {
"type": "pdf",
"state": {
"file": "Concurrent Systems/slides/class 12.pdf"
},
"icon": "lucide-file-text",
"title": "class 12"
}
} }
] ]
} }
@ -191,13 +226,14 @@
"companion:Toggle completion": false "companion:Toggle completion": false
} }
}, },
"active": "84845736e00d5c98", "active": "46d9dfa1750fc4db",
"lastOpenFiles": [ "lastOpenFiles": [
"Concurrent Systems/notes/11 - LTSs and Bisimulation.md", "Concurrent Systems/notes/13 -.md",
"Concurrent Systems/slides/class 12.pdf",
"Concurrent Systems/notes/12 - Calculus of communicating system.md", "Concurrent Systems/notes/12 - Calculus of communicating system.md",
"Concurrent Systems/notes/11 - LTSs and Bisimulation.md",
"Concurrent Systems/notes/images/Pasted image 20250414164549.png", "Concurrent Systems/notes/images/Pasted image 20250414164549.png",
"Concurrent Systems/notes/images/Pasted image 20250414181443.png", "Concurrent Systems/notes/images/Pasted image 20250414181443.png",
"Concurrent Systems/slides/class 12.pdf",
"Concurrent Systems/slides/class 11.pdf", "Concurrent Systems/slides/class 11.pdf",
"Concurrent Systems/notes/images/Pasted image 20250414173011.png", "Concurrent Systems/notes/images/Pasted image 20250414173011.png",
"Concurrent Systems/notes/images/Pasted image 20250414082824.png", "Concurrent Systems/notes/images/Pasted image 20250414082824.png",
@ -232,7 +268,6 @@
"Concurrent Systems/notes/6a - Alternatives to Atomicity.md", "Concurrent Systems/notes/6a - Alternatives to Atomicity.md",
"Concurrent.md", "Concurrent.md",
"Concurrent Systems/ignore this folder/Untitled.md", "Concurrent Systems/ignore this folder/Untitled.md",
"Foundation of data science/notes/9 XGBoost.md",
"HCIW/slides/1 Interface and Interaction for IoT.pdf", "HCIW/slides/1 Interface and Interaction for IoT.pdf",
"Concurrent Systems/slides/class 4.pdf", "Concurrent Systems/slides/class 4.pdf",
"Foundation of data science/class 9.pdf", "Foundation of data science/class 9.pdf",

9
Concurrent Systems/notes/13 -.md Normal file
View file

@ -0,0 +1,9 @@
An n-ary semaphore S(n)(p,v) is a process used to ensure that there are no more than n istances of the same activity concurrently in execution. An activity is started by action p and is terminated by action v.
The specification of a unary semaphore is the following:
$$S^{(1)} \triangleq p \cdot S_{1}^{(1)}$$
$$S_{1}^{(1)} \triangleq p \cdot S_{1}^{(1)}$$
The specification of a binary semaphore is the following:
$$S_{}^{(2)} \triangleq p \cdot S_{1}^{(2)}$$
$$S_{1}^{(2)} \triangleq p \cdot S_{1}^{(2)}+v\cdot S^{(2)}$$
$$S_{2}^{(2)} \triangleq v \cdot S_{1}^{(2)}$$