Abstract
In this paper we introduce a process calculus BBC that has both forms of communication. For both many-to-one and one-to-many communication, it is often a natural assumption that communication is bounded; this reflects two distinct aspects of the limitations of a medium. In the case of broadcast, the bound limits the number of possible recipients of a message. In the case of collection, the bound limits the number of messages that can be received. For this reason, BBC uses a notion of bounded broadcast and collection. Moreover, the syntax of the calculus introduces an explicit notion of connectivity that makes it possible to represent a communication topology directly. By using a proof technique introduced by Palamidessi we show that even a version of BBC that only uses collection is more expressive than the pi-calculus.
Original language | English |
---|---|
Title of host publication | Eighth International Workshop on Programming Language Approaches to Communication- and Concurrency-cEntric Systems |
Editors | Simon Gay, Jade Alglave |
Publisher | Electronic Proceedings in Theoretical Computer Science |
Publication date | 2015 |
Pages | 51-61 |
DOIs | |
Publication status | Published - 2015 |
Event | PLACES 2015 Eighth International Workshop on Programming Language Approaches to Concurrency- and Communication-cEntric Software - London, United Kingdom Duration: 18 Apr 2015 → 18 Apr 2015 |
Conference
Conference | PLACES 2015 Eighth International Workshop on Programming Language Approaches to Concurrency- and Communication-cEntric Software |
---|---|
Country/Territory | United Kingdom |
City | London |
Period | 18/04/2015 → 18/04/2015 |