We study encodings from CSP into asynchronous CCS with name passing and matching, so in fact, the asynchronous π-calculus. By doing so, we discuss two different ways to map the multi-way synchronisation mechanism of CSP into the two-way synchronisation mechanism of CCS. Both encodings satisfy the criteria of Gorla except for compositionality, as both use an additional top-level context. Following the work of Parrow and Sjödin, the first encoding uses a centralised coordinator and establishes a variant of weak bisimilarity between source terms and their translations. The second encoding is decentralised, and thus more efficient, but ensures only a form of coupled similarity between source terms and their translations.

No abstract

No abstract

Unfortunately there was a mistake in the amount of sample solution indicated in the abstract of this article.The sentence should thus correctly read:The use of microfluidics reduced the sample consumption drastically such that a typical step-scan experiment takes only 10 µl of a millimolar sample solution, making this method particularly interesting for the investigation of biological samples that are only available in small quantities.The online version of the original article can be found at http://dx.doi.