A Calculus of Value Broadcasts

Computation can be modelled as a sequence of values, each broadcast by one agent and instantaneously audible to all those in parallel with it. Listening agents receive the value; others lose it. Subsystems interface via translators; these can scramble values and thus hide or restrict them. Examples show the calculus describing this model to be a powerful and natural programming tool. Weak bisimulation, a candidate for observational equivalence, is defined on the basis that receiving a value can be matched by losing it.

[1]  Robin Milner,et al.  A semantics for ML concurrency primitives , 1992, POPL '92.

[2]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[3]  Richard C. T. Lee,et al.  Parallel Graph Algorithms Based Upon Broadcast Communications , 1990, IEEE Trans. Computers.

[4]  Peter Sjödin.  From LOTOS specifications to distributed implementations , 1992 .

[5]  Nancy A. Lynch,et al.  Hierarchical correctness proofs for distributed algorithms , 1987, PODC '87.

[6]  Samson Abramsky,et al.  Observation Equivalence as a Testing Equivalence , 1987, Theor. Comput. Sci..

[7]  Leonard Kleinrock,et al.  Broadcast Communications and Distributed Algorithms , 1986, IEEE Transactions on Computers.

[8]  Kenneth P. Birman,et al.  The ISIS project: real experience with a fault tolerant programming system , 1990, EW 4.

[9]  K. V. S. Prasad.  Broadcasting with Priority , 1994, ESOP.

[10]  Tzung-Pei Hong,et al.  Parallel perceptron learning on a single-channel broadcast communication model , 1992, Parallel Comput..

[11]  K. V. S. Prasad.  Programming with Broadcasts , 1993, CONCUR.

[12]  K. V. S. Prasad.  A Calculus of Broadcasting Systems , 1991, Sci. Comput. Program..

[13]  Rance Cleaveland,et al.  Priorities in process algebras , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[14]  Frits W. Vaandrager,et al.  On the relationship between process algebra and input/output automata , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[15]  Jan Friso Groote.  Transition System Specifications with Negative Premises (Extended Abstract) , 1990, CONCUR.