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

Diletta Cacciagrano (1) , Flavio Corradini (1) , Jesus Aranda (2, 3) , Frank Valencia (2)

1 Dipartimento di Matematica e Informatica [Camerino]
2 COMETE - Concurrency, Mobility and Transactions
3 EISC - Escuela de Ingenieria de Sistemas y Computacion

In [CSVV06] the authors studied the expressiveness of persistence in the asynchronous pi calculus (Api) 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 pi-calculus (Api) wrt DeNicola and Hennesy's testing scenario which is sensitive to divergence. We consider Api and theree sub-languages of it, each capturing one source of persistence: the persistent-input calculus (PIApi), the persistent-output calculus (POApi) and persistent calculus (PApi). In [CSVV06] the authors showed encodings from Api into semipersistent calculi are correct wrt weak barbed congruence. In this paper we prove that, under some general conditions, there cannot be an encoding from Api into a (semi)-persistent calculus preserving the must testing semantics. [CSVV06 ] C. Palamidessi, V. Saraswat, F. Valencia and B. Victor. On the Expressiveness of Linearity vs Persistence in the Asynchronous Pi Calculus. LICS 2006:59-68,2006.

Mots clés: Asynchronous Pi calculus; Linearity; Persistence; Testing Semantics

Domaines: Calcul formel [cs.SC]

Diletta Cacciagrano, Flavio Corradini, Jesus Aranda, Frank Valencia. Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus. 14th International Workshop on Expressiveness in Concurrency (EXPRESS'07), Sep 2007, Lisbon, Portugal. pp.58-71. ⟨inria-00201502⟩