A behavioural theory for a π-calculus with preorders - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

A behavioural theory for a π-calculus with preorders

Résumé

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
Fichier non déposé

Dates et versions

hal-01246094 , version 1 (18-12-2015)
hal-01246094 , version 2 (26-01-2017)

Identifiants

  • HAL Id : hal-01246094 , version 1

Citer

Daniel Hirschkoff, Jean-Marie Madiot, Xian Xu. A behavioural theory for a π-calculus with preorders. Proceedings of 6th IPM International Conference on Fundamentals of Software Engineering (FSEN 2015), Apr 2015, Teheran, Iran. ⟨hal-01246094v1⟩
235 Consultations
173 Téléchargements

Partager

Gmail Facebook X LinkedIn More