Encyclopedia  |   World Factbook  |   World Flags  |   Reference Tables  |   List of Lists     
   Academic Disciplines  |   Historical Timeline  |   Themed Timelines  |   Biographies  |   How-Tos     
Sponsor by The Tattoo Collection
Communicating sequential processes
Main Page | See live article | Alphabetical index

Communicating sequential processes

In computer science, Communicating Sequential Processes (CSP) is a language for describing patterns of interaction. First described in a paper by C. A. R. Hoare in 1978, the basic ideas in that paper were refined into the book "Communicating Sequentual Processes" which was published in 1985. In May 2003, that book was the third-most cited computer science reference of all time according to Citeseer.

As its name suggests, CSP allows us to describe systems as a number of components (processes) which operate independently and communicate with each other solely over well-defined channels. CSP introduces a process algebra which is used to describe a process' communications with its environment.

a -> P is the process which is willing to communicate a with its environment and after a, behaves like the process P.

STOP represents the process which can communicate nothing. It is also called deadlock.

P [] Q is the process which is willing to communicate the first events of P or of Q and then behaves accordingly. This represents deterministic choice - the environment chooses which events are done.

P |~| Q can behave like either P or Q. It can refuse to accept the first events of P or of Q and is only obliged to communicate if the environment offers both. This represents nondeterministic choice - the process can choose which events should be done. Nondeterminism can be introduced by a seemingly deterministic process as in the following:

(a -> a -> STOP) [] (a -> b -> STOP) = a -> ((a -> STOP) |~| (b -> STOP))

To give the archetypal CSP example; an abstract representation of a chocolate machine might be able to carry out two different events, 'coin' and 'choc' which represent the insertion of payment and the delivery of a chocolate respectively. A machine which demanded payment before offering a chocolate could be written as:

coin -> choc -> STOP

A person who might choose to use a coin or card could be modelled as:

(coin -> STOP) [] (card -> STOP)

These two processes can be put in parallel, the resulting processes depending on the events they must syncronise on. If this was both "coin" and "card", the resulting process would be:

coin -> choc -> STOP

whereas if synchronization was only required on "coin", the resulting process would be:

(coin -> choc -> STOP) [] (card ->STOP)

Events can be abstracted in CSP by various mechanisms such as hiding events and renaming events. If we hide the "coin" and "card" events from the second of the combined processes, we get the nondeterministic process:

(choc -> STOP) |~| STOP

This is a process which either offers a "choc" event and then stops, or just stops. In other words, if we treat the abstraction as an external view of the system (eg. someone who does not see the decision reached by the person), a nondeterminism has been introduced.

Table of contents
1 See also
2 References
3 External links

See also

References

External links