process calculi

Если вы думаете, что вы знаете овердохуя в компьютерах и программировании, расскажите мне, так, чтобы я понял, как готовить алгебру процессов. В частности, Пи-исчисление.

Сейчас это очень горячая тема – параллельность и функциональность.

Очень интересно, но очень заумно для простого инженера.

In computer science, the process calculi (or process algebras) are a diverse family of related approaches for formally modelling concurrent systems. Process calculi provide a tool for the high-level description of interactions, communications, and synchronizations between a collection of independent agents or processes. They also provide algebraic laws that allow process descriptions to be manipulated and analyzed, and permit formal reasoning about equivalences between processes (e.g., using bisimulation).

http://en.m.wikipedia.org/wiki/Process_calculus

Leading examples of process calculi include CSP, CCS, ACP, and LOTOS. More recent additions to the family include the π-calculus, the ambient calculus, PEPA, the fusion calculus and the join-calculus.

http://en.m.wikipedia.org/wiki/Process_calculus

In theoretical computer science, the π-calculus (or pi-calculus) is a process calculus. The π-calculus allows channel names to be communicated along the channels themselves, and in this way it is able to describe concurrent computations whose network configuration may change during the computation.

http://en.m.wikipedia.org/wiki/Π-calculus

Functional programs can be encoded into the π-calculus, and the encoding emphasises the dialogue nature of computation, drawing connections with game semantics. Extensions of the π-calculus, such as the spi calculus and applied π, have been successful in reasoning about cryptographic protocols. Beside the original use in describing concurrent systems, the π-calculus has also been used to reason about business processes and molecular biology.

http://en.m.wikipedia.org/wiki/Π-calculus

original post http://vasnake.blogspot.com/2015/04/process-calculi.html