A behavioural theory for a π-calculus with preorders

Daniel Hirschkoff (1, 2, 3) , Jean-Marie Madiot (1, 2, 3) , Xian Xu (4)

1 LIP - Laboratoire de l'Informatique du Parallélisme
2 FOCUS - Foundations of Component-based Ubiquitous Systems
3 PLUME - Preuves et Langages
4 BASICS

We study the behavioural theory of piP, a pi-calculus featuring restriction as the only binder. In contrast with calculi such as Fusions and Chi, reduction in piP generates a preorder on names rather than an equivalence relation. We present two characterisations of barbed congruence in piP: the fi rst is based on a compositional LTS, and the second is an axiomatisation. The results in this paper bring out basic properties of piP, mostly related to the interplay between the restriction operator and the preorder on names

Mots clés: labelled transition system; behavioural equivalence; process calculi; axiomatisation

Domaines: Logique en informatique [cs.LO]

Daniel Hirschkoff, Jean-Marie Madiot, Xian Xu. A behavioural theory for a π-calculus with preorders. 2014. ⟨hal-00949521⟩