A behavioural theory for a π-calculus with preorders
type: Dataset
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
issued: 2026-05-06T07:39:01.880983
language: en
modified: 2026-05-06T07:39:01.880988
contact point: Organization
  fn: CCSD
keyword: axiomatisation
keyword: behavioural-equivalence
keyword: infoeu-reposemanticspreprint
keyword: infoinfo-locomputer-science-cslogic-in-computer-science-cslo
keyword: labelled-transition-system
keyword: preprints-working-papers-
keyword: process-calculi
landing page: https://hal.science/hal-00949521

A behavioural theory for a π-calculus with preorders
type: Distribution
format: HTML
issued: 2026-05-06T07:39:01.885158
modified: 2026-05-06T07:39:01.872208
access URL: https://hal.science/hal-00949521

test_moissonnage_selune
type: Agent