A behavioural theory for a π-calculus with preorders

Daniel Hirschkoff 1 Jean-Marie Madiot 2, 1 Xian Xu 3
2 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
East China University of Science and Technology
Abstract : 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
Document type :
Conference papers
Complete list of metadatas

Contributor : Daniel Hirschkoff <>
Submitted on : Friday, December 18, 2015 - 9:12:20 AM
Last modification on : Wednesday, October 3, 2018 - 11:44:25 AM


  • HAL Id : hal-01246094, version 1



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⟩



Record views