Separation Results Via Leader Election Problems

Vigliotti, Maria Grazia; Phillips, Iain; Palamidessi, Catuscia

doi:10.1007/11804192_9

Cited by 2 publications

(2 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Homomorphism w.r.t parallelism, also called distributionpreserving [33,26,27], can arguably be considered as a reasonable requirement for an encoding. In particular, the works [33,26,27,23,9,16,17] support the distributionpreserving hypothesis by arguing that it corresponds to requiring that the degree of distribution of the processes is maintained by the translation, i.e. no coordinator is added.…”

Section: Compositionality and Multi-hole Contextsmentioning

confidence: 99%

Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus

Cacciagrano

Corradini

Aranda

et al. 2008

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

In [24] the authors studied the expressiveness of persistence in the asynchronous π-calculus (Aπ) wrt weak barbed congruence. The study is incomplete because it ignores the issue of divergence. In this paper, we present an expressiveness study of persistence in the asynchronous π-calculus (Aπ) wrt De Nicola and Hennessy's testing scenario which is sensitive to divergence. Following [24], we consider Aπ and three sub-languages of it, each capturing one source of persistence: the persistent-input calculus (PIAπ), the persistent-output calculus (POAπ) and persistent calculus (PAπ). In [24] the authors showed encodings from Aπ into the semi-persistent calculi (i.e., POAπ and PIAπ) correct wrt weak barbed congruence. In this paper we prove that, under some general conditions, there cannot be an encoding from Aπ into a (semi)-persistent calculus preserving the must testing semantics.

show abstract

Section: Compositionality and Multi-hole Contextsmentioning

confidence: 99%

Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus

Cacciagrano

Corradini

Aranda

et al. 2008

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…Still, before this proof, we need to set the requirements for the notion of encoding. Following Palamidessi [22]…”

Section: The Expressivity Gap Between Ccsmentioning

confidence: 99%

The Expressive Power of Synchronizations

Laneve

Vitale

2010

2010 25th Annual IEEE Symposium on Logic in Computer Science

View full text Add to dashboard Cite

A synchronization is a mechanism allowing two or more processes to perform actions at the same time. We study the expressive power of synchronizations gathering more and more processes simultaneously. We demonstrate the nonexistence of a uniform, fully distributed translation of Milner's CCS with synchronizations of n + 1 processes into CCS with synchronizations of n processes that retains a "reasonable" semantics. We then extend our study to CCS with symmetric synchronizations allowing a process to perform both inputs and outputs at the same time. We demonstrate that synchronizations containing more than three input/output items are encodable in those with three items, while there is an expressivity gap between three and two.

show abstract

Separation Results Via Leader Election Problems

Cited by 2 publications

References 27 publications

Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus

Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus

The Expressive Power of Synchronizations

Contact Info

Product

Resources

About