A Behavioural Theory for a π-calculus with Preorders

Daniel Hirschkoff 1, 2 Jean-Marie Madiot 1, 3, 2 Xian Xu 4
2 PLUME - Preuves et Langages
LIP - Laboratoire de l'Informatique du Parallélisme
3 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
Abstract : We study the behavioural theory of πP, a π-calculus in the tradition of Fusions and Chi calculi. In contrast with such calculi, reduction in πP generates a preorder on names rather than an equivalence relation. We present two characterisations of barbed congruence in πP: the first is based on a compositional LTS, and the second is an axiomatisation. The results in this paper bring out basic properties of πP, mostly related to the interplay between the restriction operator and the preorder on names.Consequently, πP is a calculus in the tradition of Fusion calculi, in which both types and behavioural equivalences can be exploited in order to reason rigorously about concurrent and mobile systems.
Document type :
Conference papers
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-01246094
Contributor : Hal Ifip <>
Submitted on : Thursday, January 26, 2017 - 10:43:16 AM
Last modification on : Thursday, October 4, 2018 - 1:19:05 AM

File

978-3-319-24644-4_10_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Daniel Hirschkoff, Jean-Marie Madiot, Xian Xu. A Behavioural Theory for a π-calculus with Preorders. 6th Fundamentals of Software Engineering (FSEN), Apr 2015, Tehran, Iran. pp.143-158, ⟨10.1007/978-3-319-24644-4_10⟩. ⟨hal-01246094v2⟩

Share

Metrics

Record views

224

Files downloads

103