Abstract

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 differ 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. Reversi...

Citations

3116	Communicating sequential processes - Hoare - 1978
2970	Communication and Concurrency - Milner - 1989
1962	Statecharts: A visual formalism for complex systems - Harel - 1987
668	Linda in context - Carriero, Gelernter - 1989
619	The Esterel synchronous programming language: Design, semantics, implementation - Berry, Gonthier - 1992
374	Algebraic theory of processes - Hennessy - 1988
363	M.: Testing Equivalences for Processes - Nicola, Hennessy - 1984
350	Hierarchical correctness proofs for distributed algorithms - Lynch, Tuttle - 1987
337	D.R.: Ethernet: distributed packet switching for local computer networks - Metcalfe, Boggs - 1976
305	The aloha system - another alternative for computer communications - Abramson - 1970
266	Abstract types have existential type - Mitchell, Plotkin - 1988
156	FACILE: A symmetric integration of Concurrent and Functional Programming - Giacalone, Mishra, et al. - 1989
146	Symbolic bisimulations - Hennessy, Lin - 1992
107	Transition System Specification with Negative Premises - Groote - 1990
94	Priority in process algebra - Cleaveland, Luttgen, et al. - 2001
80	A semantics for ML concurrency primitives - Berry, Milner, et al. - 1992
70	The ISIS project: real experience with a fault tolerant programming system - Birman, Cooper - 1991
61	Observation equivalence as a testing equivalence - Abramsky - 1987
39	CCS with priority choice - Camilleri, Winskel - 1995
34	A theory of synchrony and asynchrony - He, Josephs, et al. - 1990
33	and branching structures in the semantics and logics of reactive systems - Linear
28	Proof systems for message-passing process algebras - Hennessy, Lin - 1993
25	PFL: A functional language for parallel programming - Holmström - 1983
23	Broadcast Communication and Distributed Algorithms - Dechter, Kleinrock - 1986
20	Nondeterminism with referential transparency in functional programming languages - Burton - 1986
20	Programming with broadcasts - Prasad - 1993
16	A Calculus of value broadcasts - Prasad - 1992
16	Parallel Graph Algorithms Based Upon Broadcast Communications - Yang, Lee, et al. - 1990
15	J.V.: Process algebra with asynchronous communication mechanisms - Bergstra, Klop, et al. - 1985
15	A Context Dependent Equivalence Between Processes - Larsen - 1987
12	Co-Inductive Types in Coq : An Experiment with the Alternating Bit Protocol. Submitted for the proceedings of the BRA Workshop on Types for Proofs and Programs. Also available by ftp at ftp.ens-lyon.fr/pub/users/LIP/ABP.ps.Z - Gim'enez - 1995
11	Combinators and Bisimulation Proofs for Restartable Systems - Prasad - 1991
11	Distributed Systems and Computer Networks - Sloman, Kramer - 1987
8	Programming with behaviours in an ML framework: the syntax and semantics of LCS - Berthomieu, Sergent - 1994
8	Priorities and abstraction in process algebra - Natarajan, Christoff, et al. - 1994
8	Broadcasting with priority - Prasad - 1994
8	A process algebraic view of input/output automata - Nicola, Segala - 1995
7	Delay-insensitive circuits: An algebraic approach to their design - Josephs, Udding - 1990
7	CML: A Higher Order Concurrent Language - Reppy - 1991
6	Broadcast Sequential Processes - Gehani - 1984
6	Bisimulations for a calculus of broadcasting systems - Hennessy, Rathke - 1998
5	A bibliography on multicast and group communications - Chanson, Neufeld, et al. - 1989
5	From LOTOS Specifications to Distributed Implementations - Sjödin
4	Translating broadcast communication into SCCS - Holmer - 1993
4	Translating CBS to LML - Jones - 1992
4	Process Calculi with Asynchronous Communication - Hansen, Kleist - 1994
4	Broadcasting in time - Prasad - 1993
3	Profiling parallelism - Runciman, Wakeling - 1993
2	Tools for a calculus of broadcasting systems - Petersson - 1994
2	On the non-derivability of operators in CCS - Prasad - 1989