CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

A Calculus of Broadcasting Systems

K. V. S. Prasad (Institutionen för informationsbehandling)
Samson Abramsky, T. S. E. Maibaum (Eds.): TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8-12, 1991, Volume 1: Colloquium on Trees in Algebra and Programming (CAAP'91). Springer 1991 Lecture Notes in Computer Science p. 338-358. (1991)
[Konferensbidrag, refereegranskat]

CBS is a simple and natural CCS-like calculus where processes speak one at a time and are 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 dier from those of CCS. The change from handshake communication in CCS to broadcast in CBS permits several advances. (1) Priority, which attaches only to autonomous actions, is simply added to CBS in contrast to CCS, where such actions are the result of communication. (2) 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. (3) 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. This paper reports the stable aspects of an evolving study.



Denna post skapades 2014-02-04. Senast ändrad 2014-02-04.
CPL Pubid: 193399

 

Institutioner (Chalmers)

Institutionen för informationsbehandling (1987-1993)

Ämnesområden

Datavetenskap (datalogi)

Chalmers infrastruktur