vault backup: 2025-04-14 15:55:00
This commit is contained in:
parent
a3d9516542
commit
06a5018bf7
1 changed files with 5 additions and 0 deletions
|
@ -19,9 +19,14 @@ The set of actions we shall consider is: $N \cup \bar{N} \cup \{\tau\}$
|
||||||
It is also useful to force some processes of the system to synchronize between them (without the possibility of showing to the outside some actions)
|
It is also useful to force some processes of the system to synchronize between them (without the possibility of showing to the outside some actions)
|
||||||
|
|
||||||
The restriction operator P\a restricts the scope of name a to process P (a is visible only from within P)
|
The restriction operator P\a restricts the scope of name a to process P (a is visible only from within P)
|
||||||
|
https://en.wikipedia.org/wiki/Calculus_of_communicating_system
|
||||||
|
|
||||||
This is similar to local variables in a procedure of an imperative program
|
This is similar to local variables in a procedure of an imperative program
|
||||||
|
|
||||||
|
The set of CCS processes is defined by the following grammar:
|
||||||
|
$$P::=\sum_{i \in I} \alpha _{i}.P_{i} \space |\space A(a_{1}\dots a
|
||||||
|
_{n})\space|\space P|Q \space | P$$
|
||||||
|
|
||||||

|

|
||||||
|
|
||||||

|

|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue