283
edits
Pipe-calculus: Difference between revisions
→Process calculus
KalmanKeri (talk | contribs) (→Notes) |
KalmanKeri (talk | contribs) |
||
| Line 133: | Line 133: | ||
=== Process calculus === | === Process calculus === | ||
Process calculi (or process algebras) is an approach for formally modeling concurrent systems. ''Process'' refers to the behavior of a system. The word ''algebra'' denotes an algebraic approach in talking about behavior, while the word ''calculus'' emphasizes the computational aspect of processes. | [[wikipedia:process_calculus | Process calculi]] (or process algebras) is an approach for formally modeling concurrent systems. ''Process'' refers to the behavior of a system. The word ''algebra'' denotes an algebraic approach in talking about behavior, while the word ''calculus'' emphasizes the computational aspect of processes. | ||
<ref> | <ref> | ||
[https://pdf.sciencedirectassets.com/271538/1-s2.0-S0304397500X05853/1-s2.0-S0304397505000307/main.pdf?X-Amz-Security-Token=IQoJb3JpZ2luX2VjEN%2F%2F%2F%2F%2F%2F%2F%2F%2F%2F%2FwEaCXVzLWVhc3QtMSJIMEYCIQCMZBB4AA1udjrVniZfBXgYqHN4EiFJ94RntrWOYPy56AIhAN9Xlt44hS J.C.M. Baeten: A brief history of process algebra.] | [https://pdf.sciencedirectassets.com/271538/1-s2.0-S0304397500X05853/1-s2.0-S0304397505000307/main.pdf?X-Amz-Security-Token=IQoJb3JpZ2luX2VjEN%2F%2F%2F%2F%2F%2F%2F%2F%2F%2F%2FwEaCXVzLWVhc3QtMSJIMEYCIQCMZBB4AA1udjrVniZfBXgYqHN4EiFJ94RntrWOYPy56AIhAN9Xlt44hS J.C.M. Baeten: A brief history of process algebra.] | ||
| Line 153: | Line 153: | ||
* The pipe operation can be seen as a restricted, unidirectional parallel composition. | * The pipe operation can be seen as a restricted, unidirectional parallel composition. | ||
However there are notable differences | However there are notable differences. | ||
In pipe-calculus there is no counterpart of '''hiding''' that prevents interference between two groups of processes that are using the same channel name for communication. | Communication primitives in mainstream process calculi often unify two conceptual steps: the selection of a communication target (e.g. a channel or another process) and the act of message sending. The two steps are unseparable. Although one can introduce as a convention '''synchronization''' where the communicated message is ignored, and '''broadcast''' where a group of processes are waiting for messages on the same channel. | ||
In pipe-calculus these steps are separated by design and one can build the usual communication primitives on demand. | |||
In pipe-calculus there is no counterpart of '''hiding''' that prevents interference between two groups of processes that are using the same channel name for communication. Since there is no general, bidirectional parallel composition, we don't need a hiding primitive. The pipe operation naturally restricts communication to a pipeline. | |||
In pipe-calculus, if a process fails to synchronize, it is aborted. This is different from the usual implementation where a process that fails to synchronize, does not evolve, it keeps "waiting" for a message. This semantics opens up the possibility for asynchronous communication. As a consequence, communication in pipe-calculus is inherently synchronous. | In pipe-calculus, if a process fails to synchronize, it is aborted. This is different from the usual implementation where a process that fails to synchronize, does not evolve, it keeps "waiting" for a message. This semantics opens up the possibility for asynchronous communication. As a consequence, communication in pipe-calculus is inherently synchronous. | ||