vault backup: 2025-04-29 09:13:47
This commit is contained in:
parent
cf218af2e4
commit
a3651d568e
3 changed files with 12 additions and 1 deletions
|
@ -36,4 +36,15 @@ replacing one by one every continuation with its standard form, obtaining standa
|
|||

|
||||
|
||||
### Axioms & Rules for Weak Bisimilarity
|
||||

|
||||
|
||||
#### Example
|
||||
A server for exchanging messages, in its minimal version, receives a request for sending messages and delivers the confirmation of the reception
|
||||
|
||||
Specification: $$Spec \triangleq send.\overline{rcv}$$
|
||||
The behavior of such a server can be implemented by three processes in parallel:
|
||||
- one handles the button for sending
|
||||
- another one effectively sends the message (through the restricted action *put*) and waits for the signal of message reception (through the restricted action *go*)
|
||||
- the last one gives back to the user the outcome of the sending
|
||||
|
||||
$$S \triangleq send.\overline{put} \quad M \triangleq send.\overline{put}$$
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue