vault backup: 2025-04-30 17:58:22
This commit is contained in:
parent
f7094c59c0
commit
82e6f69469
3 changed files with 7 additions and 1 deletions
2
.obsidian/workspace.json
vendored
2
.obsidian/workspace.json
vendored
|
@ -193,6 +193,7 @@
|
||||||
},
|
},
|
||||||
"active": "ec8d1a91f1f0cc7e",
|
"active": "ec8d1a91f1f0cc7e",
|
||||||
"lastOpenFiles": [
|
"lastOpenFiles": [
|
||||||
|
"Pasted image 20250430175412.png",
|
||||||
"Pasted image 20250430171336.png",
|
"Pasted image 20250430171336.png",
|
||||||
"Concurrent Systems/slides/class 13.pdf",
|
"Concurrent Systems/slides/class 13.pdf",
|
||||||
"Concurrent Systems/notes/13 - Weak Bisimilarity.md",
|
"Concurrent Systems/notes/13 - Weak Bisimilarity.md",
|
||||||
|
@ -209,7 +210,6 @@
|
||||||
"Concurrent Systems/notes/images/Pasted image 20250429085319.png",
|
"Concurrent Systems/notes/images/Pasted image 20250429085319.png",
|
||||||
"Concurrent Systems/notes/images/Pasted image 20250429084950.png",
|
"Concurrent Systems/notes/images/Pasted image 20250429084950.png",
|
||||||
"Concurrent Systems/notes/images/Pasted image 20250429084921.png",
|
"Concurrent Systems/notes/images/Pasted image 20250429084921.png",
|
||||||
"Concurrent Systems/notes/images/Pasted image 20250429084358.png",
|
|
||||||
"Concurrent Systems/slides/class 12.pdf",
|
"Concurrent Systems/slides/class 12.pdf",
|
||||||
"Concurrent Systems/notes/11 - LTSs and Bisimulation.md",
|
"Concurrent Systems/notes/11 - LTSs and Bisimulation.md",
|
||||||
"HCIW/slides/HCI in the car.pdf",
|
"HCIW/slides/HCI in the car.pdf",
|
||||||
|
|
|
@ -139,3 +139,9 @@ The specification is:
|
||||||
if $i \in X$ then:
|
if $i \in X$ then:
|
||||||
$$S_{i,X}=\sum_{j \in X}b_{j}.S_{i,X-\{ j \}}$$
|
$$S_{i,X}=\sum_{j \in X}b_{j}.S_{i,X-\{ j \}}$$
|
||||||
otherwise: $$S_{i,X}=a_{i}.S_{(i \space mod \space n)+1,X\cup \{ i \}} + \sum_{j \in X}b_{j}.S_{i,X-\{ j \}}$$
|
otherwise: $$S_{i,X}=a_{i}.S_{(i \space mod \space n)+1,X\cup \{ i \}} + \sum_{j \in X}b_{j}.S_{i,X-\{ j \}}$$
|
||||||
|
Starting config $S_{1,\{ \}}$
|
||||||
|
LTS for $n=2$:
|
||||||
|

|
||||||
|
|
||||||
|
We can try to implement the scheduler in the following way:
|
||||||
|
$$A_{i}=a_{i}.B_{i} \quad B_{i}=\bar{c}_{(i \space mod \space n)+1}.C_{i} \quad C_{i}=b_{i}.D_{i} \quad D_{i}=c_{i}.A_{i}$$
|
||||||
|
|
BIN
Pasted image 20250430175412.png
Normal file
BIN
Pasted image 20250430175412.png
Normal file
Binary file not shown.
After Width: | Height: | Size: 60 KiB |
Loading…
Add table
Add a link
Reference in a new issue