
AbstractThe join-calculus was introduced as an ‘extended subset’ of the asynchronous π-calculus by amalgamating the three operators for input, restriction, and replication into a single operator, called definition, but with the additional capability to describe the atomic joint reception of values from two different channels. In this paper, we just extend the asynchronous π-calculus with joint input. By studying its expressive power, using slight variations of previously investigated choice encodings, we also conclude on the expressiveness of the join-calculus.
Theoretical Computer Science, Computer Science(all)
Theoretical Computer Science, Computer Science(all)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 12 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
