A Behavioural Theory for a π-calculus with Preorders - Fundamentals of Software Engineering Access content directly
Conference Papers Year : 2015

A Behavioural Theory for a π-calculus with Preorders

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.
Fichier principal
Vignette du fichier
978-3-319-24644-4_10_Chapter.pdf (466.69 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Licence

Attribution

Identifiers

Cite

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⟩
230 View
171 Download

Altmetric

Share

Gmail Facebook X LinkedIn More