(Enter summary)
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... (Update)
Similar documents based on text: More All
0.5: Programming With Broadcasts - Prasad (1993)
(Correct)
0.5: Broadcasting in Time - Prasad (1995)
(Correct)
0.5: Broadcast Communication Interpreted In CCS - Prasad (2000)
(Correct)
Related documents from co-citation: More All
11: Communication and Concurrency (context) - Milner - 1989
11: Department of Computer Science (context) - Prasad, time - 1993
9: Programming with broadcasts
- Prasad - 1993
BibTeX entry: (Update)
K. V. S. Prasad. A calculus of broadcasting systems. In TAPSOFT'91 Volume 1: CAAP, April 1991. Springer Verlag LNCS 493. http://citeseer.ist.psu.edu/prasad95calculus.html More
@inproceedings{ prasad91calculus,
author = "K. Prasad",
title = "{A Calculus of Broadcasting Systems}",
booktitle = "Proc. 16th Colloquium on Trees in Algebra and Programming",
volume = "493",
publisher = "Springer-Verlag, Berlin",
address = "Brighton, UK",
editor = "S. Abramski and T. Maibaum",
pages = "338--358",
year = "1991",
url = "citeseer.ist.psu.edu/prasad95calculus.html" }
Citations (may not include all citations):
2732
Communicating Sequential Processes (context) - Hoare - 1985
1933
Communication and Concurrency (context) - Milner - 1989
1174
Statecharts: A visual formalism for complex systems
- Harel - 1987
457
The ESTEREL synchronous programming language: Design
- Berry, Gonthier - 1992
311
Abstract types have existential types (context) - Mitchell, Plotkin - 1985
309
Communications of the ACM (context) - Carriero, Gelernter et al. - 1989
293
Hierarchical correctness proofs for distributed algorithms
- Lynch, Tuttle - 1987
187
Ethernet: Distributed packet switching for local computer ne.. (context) - Metcalfe, Boggs - 1976
168
Testing equivalences for processes (context) - de Nicola, Hennessy - 1984
139
The Aloha system---another alternative for computer communic.. (context) - Abramson - 1970
119
Facile: A symmetric integration of concurrent and functional.. (context) - Giacalone, Mishra et al. - 1989
109
Theoretical Computer Science (context) - Hennessy, Lin - 1995
84
Transition system specifications with negative premises (context) - Groote - 1990
72
A semantics for ML concurrency primitives
- Berry, Milner et al. - 1992
67
Linear and branching structures in the semantics and logics .. (context) - Pnueli - 1985
43
The ISIS project: Real experience with a fault tolerant prog.. (context) - Birman, Cooper - 1991
39
Algebraic Theory of Processes (context) - Hennessy - 1988
35
Observation equivalence as a testing equivalence (context) - Abramsky - 1987
27
A calculus of broadcasting systems
- Prasad - 1991
27
PFL: A functional language for parallel programming (context) - Holmstrom - 1983
27
Proof systems for message-passing process algebras
- Hennessy, Lin - 1993
21
Programming with broadcasts
- Prasad - 1993
17
Nondeterminism with referential transparency in functional l.. (context) - Burton - 1988
14
Broadcasting sequential processes (context) - Gehani - 1984
13
Department of Computer Science (context) - Prasad, time - 1995
12
Process algebra with asynchronous communication mechanisms (context) - Bergstra, Klop et al. - 1984
12
Distributed Systems and Computer Networks (context) - Sloman, Kramer - 1988
12
A calculus of value broadcasts
- Prasad - 1993
11
Department of Computer Science (context) - Jones, to et al. - 1993
10
A higher order concurrent language (context) - Reppy - 1991
10
A context-dependent equivalence between processes (context) - Larsen - 1987
10
Broadcasting with priority
- Prasad - 1994
8
Combinators and Bisimulation Proofs for Restartable Systems
- Prasad - 1987
8
Process calculi with asynchronous communication (context) - Kleist, Hansen - 1994
8
Information and Computation (context) - Camilleri, Winskel et al. - 1995
7
Broadcast communications and distributed algorithms (context) - Dechter, Kleinrock - 1986
7
volume 18 of Tracts in Theoretical Computer Science (context) - Baeten, Weijland - 1990
7
Department of Computer Science (context) - Runciman, Wakeling et al. - 1993
6
Implementation of co-inductive types in Coq: An experiment w.. (context) - Gim'enez - 1995
6
Delay-insensitive circuits: an algebraic approach to their d.. (context) - Josephs, Udding - 1990
3
Parallel graph algorithms based upon broadcast communication.. (context) - Yang, Lee et al. - 1990
3
Parallel perceptron learning on a single-channel broadcast c.. (context) - Hong, Tseng - 1992
3
Tools for a calculus of broadcasting systems
- Petersson - 1994
3
Bisimulations for a calculus of broadcasting systems
- Hennessy, Rathke - 1995
3
Operating Systems Review (context) - Chanson, Neufeld et al. - 1989
3
Programming Research Group (context) - Jifeng, Josephs et al. - 1990
3
Semantics for nondeterministic asynchronous broadcast networ.. (context) - Shyamasundar, Narayana et al. - 1987
2
Programming with behaviours in an ML framework; the syntax a.. (context) - Berthomieu, Le Sergent - 1994
2
A process algebraic view of input/output automata (context) - Segala - 1992
2
From LOTOS specifications to distributed implementations (context) - Sjodin - 1991
2
Interpreting broadcast communications in CCS with priority c..
- Jensen - 1994
2
the non-derivability of operators in CCS
- Prasad - 1989
2
Technical Report HPL-ISCTM (context) - Hennessy, value-passing - 1990
2
Priority and abstraction (context) - Natarajan, Christoff et al. - 1994
2
Translating broadcast communication into SCCS (context) - Holmer - 1993
2
Broadcasting buffering communication (context) - Broy - 1988
1
A theory for simulators (context) - Korver - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.chalmers.se.html): More
Variable Sets and Functions Framework for Conceptual.. - Diskin, Cadish (1995)
(Correct)
A Definitional Approach to Functional Logic Programming - Torgersson (1996)
(Correct)
The Hahn-Banach Theorem in Type Theory - Cederquist, Coquand, Negri (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC