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

Programming with Broadcasts.

K. V. S. Prasad (Institutionen för datavetenskap)
Springer 1993 Lecture Notes in Computer Science, Eike Best (Ed.): CONCUR '93, 4th International Conference on Concurrency Theory, Hildesheim, Germany, August 23-26, 1993, Proceedings. p. 173-187. (1993)
[Konferensbidrag, refereegranskat]

[Pra91, Pra92] develop CBS, a CCS-like calculus [Mil89] where processes communicate by broadcasting values along a single channel. These values are hidden or restricted by translation to noise. This paper types CBS and restricts it to processes with a unique response to each input. Non-determinism arises only if two processes in parallel both wish to transmit. These restrictions do not reduce the programming power of CBS. But strong and weak bisimulation can now be defined exactly as in CCS, yet capture observationally meaningful relations. Weak bismulation is a congruence. This paper also shows how to program in CBS in a (lazy) ML framework. A simple CBS simulator is given, and a parallel implementation discussed. The simulator represents data evaluation, recursion and conditionals directly in Lazy ML. It implements an extended CBS with evaluation as well as communication transitions.

Denna post skapades 2014-02-04.
CPL Pubid: 193395


Institutioner (Chalmers)

Institutionen för datavetenskap (1993-2001)


Datavetenskap (datalogi)

Chalmers infrastruktur