Published February 21, 2014 | Version v1
Publication

A behavioural theory for a π-calculus with preorders

Description

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

Additional details

Identifiers

URL
https://hal.science/hal-00949521
URN
urn:oai:HAL:hal-00949521v1

Origin repository

Origin repository
UNICA