On the validity of encodings of the synchronous in the asynchronous π -calculus

Glabbeek, Rob J. van

doi:10.1016/j.ipl.2018.04.015

Cited by 4 publications

(3 citation statements)

References 50 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper explores languages based on process calculi in the style of πcalculus that focus on coordinating workflows and higher-order process modelling [45,44]. The expressiveness of process calculi based upon their choice of communication primitives has been explored before [49,9,16,28,21,23,58]. In [28] and [23] this is detailed by examining combinations of four features: synchronism, arity, communication medium, and pattern-matching, and formalising their relations via valid encodings [30].…”

Section: Introductionmentioning

confidence: 99%

On the Expressiveness of Joining and Splitting

Given-Wilson

Legay

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

An ongoing theme of the work of Bernhard Steffen has been the bringing together of different components in a coordinated manner and with a unified language. This paper explores this approach applied to process calculi that account for coordination of different kinds of workflows. Coordination here extends binary interaction to also account for joining of multiple outputs into a single input, and splitting from a single output to multiple inputs. The results here formalise which process calculi can and cannot be encoded into one another, and thus which language has the required expressiveness for given workflow properties. The combination of with other features of interaction allows for the representation of many systems and workflows in an appropriate calculus.

show abstract

Section: Introductionmentioning

confidence: 99%

On the Expressiveness of Joining and Splitting

Given-Wilson

Legay

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The task of finding such translations is reminiscent of the channel-encoding used in [20], but, however, there an asynchronous channel is implemented while we look for synchronous communication.We provide a translation τ 0 which uses a private MVar per channel and per communication to ensure that no other process can interfere with the interaction. A similar idea was used in [12,3] for keeping channel names private in a different scenario (see [10,9] for recent treatments of these encodings). We prove that the translation τ 0 is correct.…”

mentioning

confidence: 99%

“…We provide a translation τ 0 which uses a private MVar per channel and per communication to ensure that no other process can interfere with the interaction. A similar idea was used in [12,3] for keeping channel names private in a different scenario (see [10,9] for recent treatments of these encodings). We prove that the translation τ 0 is correct.…”

mentioning

confidence: 99%

Correctly Implementing Synchronous Message Passing in the Pi-Calculus By Concurrent Haskell's MVars

Schmidt-Schauß

Sabel

2020

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Comparison of concurrent programming languages and correctness of program transformations in concurrency are the focus of this research. As criterion we use contextual semantics adapted to concurrency, where may-as well as should-convergence are observed. We investigate the relation between the synchronous pi-calculus and a core language of Concurrent Haskell (CH). The contextual semantics is on the one hand forgiving with respect to the details of the operational semantics, and on the other hand implies strong requirements for the interplay between the processes after translation. Our result is that CH embraces the synchronous pi-calculus. Our main task is to find and prove correctness of encodings of pi-calculus channels by CH's concurrency primitives, which are MVars. They behave like (blocking) 1-place buffers modelling the shared-memory. The first developed translation uses an extra private MVar for every communication. We also automatically generate and check potentially correct translations that reuse the MVars where one MVar contains the message and two additional MVars for synchronization are used to model the synchronized communication of a single channel in the pi-calculus. Our automated experimental results lead to the conjecture that one additional MVar is insufficient.

show abstract