Communication and concurrency
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
On Asynchronous Communication Semantics
ECOOP '91 Proceedings of the Workshop on Object-Based Concurrent Computing
Testing Theories for Asynchronous Languages
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Hi-index | 0.00 |
Most semantic theories for process calculi presuppose that communication is synchronous; the sending and receiving processes must rendezvous for the communication to occur. However there is now considerable interest in process languages based on asynchronous communication, where the sender is not blocked but may transmit a message even in the absence of a waiting receiver. On the one hand this communication paradigm is much easier to implement and consequently has been adopted by numerous recently developed process languages, [4,7]. On the other hand it has been argued in papers such as [2,5] that, at least for pi-calculus based theories, asynchrony is a more basic concept in terms of which theories of synchronous communication can be established. Despite this interest in asynchrony there has been little research into axiomatising process calculi based on this form of communication. In this talk I will survey existing results, such as those in [1,3], and discuss equational theories for synchronous versions of both value-passing CCS [6] and the pi-calculus [2].