vault backup: 2025-04-28 17:56:27

This commit is contained in:
Marco Realacci 2025-04-28 17:56:27 +02:00
parent be56d141f6
commit f58769b862
4 changed files with 22 additions and 2 deletions

View file

@ -96,3 +96,10 @@ Furthermore, we should also consider commutativity of parallel in pairs of the s
Thus, R is actually made up of 1+6+2+2+9+6+6+2 = 34 pairs.
*exercise: write down the LTSs*
### EXAMPLE: Lottery
We want to model a lottery L where we can select any ball from a bag that contains n balls; after every extraction, the extracted ball is put back in the bag and the procedure is repeated.
The specification is: $$L \triangleq \tau.\bar{p_{1}}L+\tau.\bar{p_{2}}.L+\dots+\tau.\bar{p_{n}}.L$$
where $\tau$'s represent ball extractions and $\tilde{p_{i}}$ is the action that communicates with the value of the extracted ball. The LTS resulting from this specification is:
![](../../Pasted%20image%2020250428175449.png)