%0 Conference Proceedings
%T A Behavioural Theory for a π-calculus with Preorders
%+ Laboratoire de l'Informatique du Parallélisme (LIP)
%+ Preuves et Langages (PLUME)
%+ Foundations of Component-based Ubiquitous Systems (FOCUS)
%+ East China University of Science and Technology
%A Hirschkoff, Daniel
%A Madiot, Jean-Marie
%A Xu, Xian
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 6th Fundamentals of Software Engineering (FSEN)
%C Tehran, Iran
%Y Mehdi Dastani
%Y Marjan Sirjani
%I Springer
%3 Fundamentals of Software Engineering
%V LNCS-9392
%P 143-158
%8 2015-04-22
%D 2015
%R 10.1007/978-3-319-24644-4_10
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 2
%Z WG 2.2
%2 https://inria.hal.science/hal-01246094v2/document
%2 https://inria.hal.science/hal-01246094v2/file/978-3-319-24644-4_10_Chapter.pdf
%L hal-01246094
%U https://inria.hal.science/hal-01246094
%~ ENS-LYON
%~ CNRS
%~ INRIA
%~ UNIV-LYON1
%~ INRIA-SOPHIA
%~ INRIASO
%~ INRIA_TEST
%~ TESTALAIN1
%~ IFIP-LNCS
%~ IFIP
%~ INRIA2
%~ IFIP-TC
%~ IFIP-TC2
%~ IFIP-WG2-2
%~ IFIP-LNCS-9392
%~ IFIP-FSEN
%~ UNIV-COTEDAZUR
%~ UDL
%~ UNIV-LYON