|
The Calculus of Communicating Systems (or CCS) (one of the first process calculi) was developed by Robin Milner. Its actions model indivisible communications between exactly two participants. The formal language includes primitives for describing parallel composition, choice between actions and scope restriction. In the first half of the 20th century, various formalisms were proposed to capture the informal concept of computable function, μ-recursive functions, Turing machines and the lambda calculus possibly being the most well-known examples today. ...
Robin Milner is a prominent British computer scientist. ...
According to Milner, "There is nothing canonical about the choice of the basic combinators, even though they were chosen with great attention to economy. What characterises our calculus is not the exact choice of combinators, but rather the choice of interpretation and of mathematical framework".
The expressions of the language are interpreted as a labelled transition system. Between these models, bisimulation is used as a semantic equivalence. In theoretical computer science, a state transition system is an abstract machine used in the study of computation. ...
In theoretical computer science a bisimulation is an equivalence relation between state transition systems, associating systems which behave in the same way in the sense that one system simulates the other and vice-versa. ...
See also
In computer science, the Actor model, first published in 1973, is a mathematical model of concurrent computation. ...
See also Pi-Calculus Communicating sequential processes Haskell Bisimulation Alternating Bit Protocol References K. V. S. Prasad: Calculus of Broadcasting Systems, Science of Computer Programming, 25, 1995 K. V. S. Prasad: Programming with broadcasts, Lecture Notes in Computer Science, Vol. ...
In computer science, Communicating Sequential Processes (CSP) is a language for describing patterns of interaction. ...
Language Of Temporal Ordering Specification (LOTOS) is a formal specification language based on temporal ordering used for protocol specification in ISO OSI standards. ...
In theoretical computer science, the π-calculus is a notation originally developed by Robin Milner, Joachim Parrow and David Walker to model concurrency (just as the λ-calculus is a simple model of sequential programming languages). ...
In the first half of the 20th century, various formalisms were proposed to capture the informal concept of computable function, μ-recursive functions, Turing machines and the lambda calculus possibly being the most well-known examples today. ...
References - Robin Milner: A Calculus of Communicating Systems, Springer Verlag, ISBN 0387102353
External links |
Feeds |
Contact