On Synchronous and Asynchronous Communication Paradigms

Cacciagrano, Diletta; Corradini, Flavio

doi:10.1007/3-540-45446-2_16

Cited by 11 publications

(13 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…arbitrary contexts in the source and typeble contexts in the target. The first two authors explore in [8] similar issues w.r.t. testing semantics.…”

Section: Proof Of the Main Resultsmentioning

confidence: 99%

“…It is worth noting that our result would not be valid under such a fairness assumption. One indication in this sense is the result in [8], which proves the correctness of Boudol's encoding wrt fair must testing. However fair must testing does not coincide exactly with must testing under a fairness assumption (see [11]) hence the correctness wrt the latter notion is not implied by the result in [8].…”

Section: Introductionmentioning

confidence: 84%

“…The first two authors started to investigate the properties of Boudol's encoding w.r.t. various testing theories in [8]. They were particularly interested in establishing conditions on [[•]] and on R so that (1) would hold.…”

Section: Introductionmentioning

confidence: 99%

“…In [8] the first two authors proposed a refinement of the testing theories by considering only encoded tests on the right hand side, and proved that Boudol's encoding [[•]] satisfies the following:…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Separation of synchronous and asynchronous communication via testing

Cacciagrano

Corradini

Palamidessi

2007

Theoretical Computer Science

View full text Add to dashboard Cite

International audienceOne of the early results about the asynchronous $\pi$-calculus which significantly contributed to its popularity is the capability of encoding the output prefix of the (choiceless) $\pi$-calculus in a natural and elegant way. Encodings of this kind were proposed by Honda and Tokoro, by Nestmann and (independently) by Boudol. We investigate whether the above encodings preserve De Nicola and Hennessy's testing semantics. In this sense, it turns out that, under some general conditions, no encoding of output prefix is able to preserve the must testing. This negative result is due to (a) the non atomicity of the sequences of steps which are necessary in the asynchronous $\pi$-calculus to mimic synchronous communication, and (b) testing semantics's sensitivity to divergence

show abstract

“…arbitrary contexts in the source and typeble contexts in the target. The first two authors explore in [8] similar issues w.r.t. testing semantics.…”

Section: Proof Of the Main Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 84%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Separation of synchronous and asynchronous communication via testing

Cacciagrano

Corradini

Palamidessi

2007

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…In particular, the encoding provided in [24] from Aπ into PIAπ is weak barbed congruent preserving but not divergence preserving. Although in some situations divergence may be ignored, in general it is an important issue to consider in the correctness of encodings [8,17,16,18,7].…”

Section: Expressiveness Of Persistence -Drawbacks and Conjecturesmentioning

confidence: 99%

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

Cacciagrano

Corradini

Aranda

et al. 2008

Electronic Notes in Theoretical Computer Science

Self Cite

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