The Expressive Power of Synchronizations

Laneve, Cosimo; Vitale, A.

doi:10.1109/lics.2010.15

Cited by 12 publications

(8 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In further research we want to analyse e.g. what kind of synchronisation patterns are expressed by polyadic synchronisation in [5] or by the synchronisation mechanisms described in [11].…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

On Distributability in Process Calculi

Peters

Nestmann

Goltz

2013

Lecture Notes in Computer Science

100

View full text Add to dashboard Cite

We present a novel approach to compare process calculi and their synchronisation mechanisms by using synchronisation patterns and explicitly considering the degree of distributability. For this, we propose a new quality criterion that (1) measures the preservation of distributability and (2) allows us to derive two synchronisation patterns that separate several variants of pi-like calculi. Precisely, we prove that there is no good and distributability-preserving encoding from the synchronous pi-calculus with mixed choice into its fragment with only separate choice, and neither from the asynchronous pi-calculus (without choice) into the join-calculus.

show abstract

“…In further research we want to analyse e.g. what kind of synchronisation patterns are expressed by polyadic synchronisation in [5] or by the synchronisation mechanisms described in [11].…”

Section: Resultsmentioning

confidence: 99%

“…P | Q , is used as a criterion (see e.g. [17,5,11]). Such an encoding naturally preserves the parallel structure of terms and, thus (at least for process calculi such as CSP or the pi-calculus), the degree of distribution.…”

Section: Introductionmentioning

confidence: 99%

On Distributability in Process Calculi

Peters

Nestmann

Goltz

2013

Lecture Notes in Computer Science

100

View full text Add to dashboard Cite

show abstract

“…More sophisticated forms of synchronisations, with a fixed number of processes, are introduced in π-calculus in [30] (joint input) and in [31] (polyadic synchronisation). The focus of [32] is instead on the expressiveness of an asynchronous CCS equipped with joint inputs allowing the interactions of n processes, proving that there is no truly distributed implementation of operators synchronising more than three processes. As in the Join-calculus [33], and differently from our approach, participants can act either as senders or as receivers.…”

Section: Concluding Remarks and Related Workmentioning

confidence: 99%

A formal approach to open multiparty interactions

Bodei

Brodo

Bruni

2019

Theoretical Computer Science

View full text Add to dashboard Cite

We present a process algebra aimed at describing interactions that are multiparty, i.e. that may involve more than two processes and that are open, i.e. the number of the processes they involve is not fixed or known a priori. Here we focus on the theory of a core version of a process calculus, without message passing, called Core Network Algebra (CNA). In CNA communication actions are given not in terms of channels but in terms of chains of links that record the source and the target ends of each hop of interactions. The operational semantics of our calculus mildly extends the one of CCS. The abstract semantics is given in the style of bisimulation but requires some ingenuity. Remarkably, the abstract semantics is a congruence for all operators of CNA and also with respect to substitutions, which is not the case for strong bisimilarity in CCS. As a motivating and running example, we illustrate the model of a simple software defined network infrastructure.

show abstract

“…That a language with coordination degree n cannot be encoded into a language with coordination degree less than n aligns with some recent results. Laneve and Vitale considered "synchronization" from a perspective that appears similar but is in fact rather different [36]. They consider languages to have n-join forms where n is the number of inputs a process can have.…”

Section: Discussionmentioning

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

The Expressive Power of Synchronizations

Cited by 12 publications

References 28 publications

On Distributability in Process Calculi

On Distributability in Process Calculi

A formal approach to open multiparty interactions

On the Expressiveness of Joining and Splitting

Contact Info

Product

Resources

About