Communicating sequential processes
Communicating sequential processes
A calculus of mobile processes, I
Information and Computation
A calculus of broadcasting systems
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
Comparing the expressive power of the synchronous and the asynchronous &pgr;-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communication and Concurrency
Interpreting Broadcast Communication in SCCS
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Bisimulations for a Calculus of Broadcasting Systems
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
A Broadcast-based Calculus for Communicating Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Contexts, refinement and determinism
Science of Computer Programming
Broadcast psi-calculi with an application to wireless protocols
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
Separation results via leader election problems
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
On the relative expressive power of asynchronous communication primitives
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Stochastic restricted broadcast process theory
EPEW'11 Proceedings of the 8th European conference on Computer Performance Engineering
On the expressive power of global and local priority in process calculi
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
In this paper we address the problem of the expressive power of point-to-point communication to implement broadcast communication. We demonstrate that point-to-point communication as in CCS [M89] is "too asynchronous" to implement broadcast communication as in CBS [P95]. Milner's π-calculus [M91] is a calculus in which all communications are point-to-point. We introduce bπ-calculus, using broadcast instead of rendez-vous primitive communication, as a variant of value-passing CBS in which communications are made on channels as in Hoare's CSP [H85] - and channels can be transmitted too as in π-calculus - but by a broadcast protocol: processes speak one at a time and are heard instantaneously by all others. In this paper, using the fact that π-calculus enjoys a certain interleaving property, whereas bπ-calculus does not, we prove that there does not exist any uniform, parallel-preserving translation from bπ-calculus into π-calculus, up to any "reasonable" equivalence. Using arguments similar to [P97], we also prove a separation result between CBS and CCS.