Calculus of Broadcasting Systems
From Wikipedia, the free encyclopedia
Calculus of Broadcasting Systems (CBS) is a CCS-like calculus where processes speak one at a time and each is heard instantaneously by all others. Speech is autonomous, contention between speakers being resolved nondeterministically, but hearing only happens when someone else speaks. Observationally meaningful laws differ from those of CCS. The handshake communication of CCS is changed to broadcast communication in CBS. This allows several additional features:
- Priority, which attaches only to autonomous actions, is simply added to CBS in contrast to CCS, where such actions are the result of communication.
- A CBS simulator runs a process by returning a list of values it broadcasts. This permits a powerful combination, CBS with the host language. It yields several elegant algorithms. Only processes with a unique response to each input are needed in practice, so weak bisimulation is a congruence.
- CBS subsystems are interfaced by translators; by mapping messages to silence, these can restrict hearing and hide speech. Reversing a translator turns its scope inside out. This permits a new specification for a communication link – the environment of each user should behave like the other user.
[edit] See also
- Pi-calculus
- Calculus of communicating systems (CCS)
- Communicating sequential processes (CSP)
- Bisimulation
- Alternating bit protocol
[edit] References
- K. V. S. Prasad: A Calculus of Broadcasting Systems, Science of Computer Programming, 25, 1995.
- K. V. S. Prasad: Programming with broadcasts, Lecture Notes in Computer Science, Vol. 715, CONCUR, 1993, Springer-Verlag.
- K. V. S. Prasad: Broadcasting in time, Lecture Notes in Computer Science, Vol. 1061, COORDINATION, 1996, Springer-Verlag.
