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

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.

• Type: Journal
• Year: 2008
• Where: ENTCS
• Authors: Diletta Cacciagrano, Flavio Corradini, Jesús Aranda, Frank D. Valencia
• Keywords: Calculus, ENTCS 2008, Expressiveness Study, Wrt De Nicola