An intensionally fully-abstract sheaf model for π (expanded version)

by   Clovis Eberhart, et al.

Following previous work on CCS, we propose a compositional model for the π-calculus in which processes are interpreted as sheaves on certain simple sites. Such sheaves are a concurrent form of innocent strategies, in the sense of Hyland-Ong/Nickau game semantics. We define an analogue of fair testing equivalence in the model and show that our interpretation is intensionally fully abstract for it. That is, the interpretation preserves and reflects fair testing equivalence; and furthermore, any innocent strategy is fair testing equivalent to the interpretation of some process. The central part of our work is the construction of our sites, relying on a combinatorial presentation of π-calculus traces in the spirit of string diagrams.


page 1

page 2

page 3

page 4


Fully Abstract Encodings of λ-Calculus in HOcore through Abstract Machines

We present fully abstract encodings of the call-by-name and call-by-valu...

Game Semantics: Easy as Pi

Game semantics has proven to be a robust method to give compositional se...

Reward Testing Equivalences for Processes

May and must testing were introduced by De Nicola and Hennessy to define...

A subexponential view of domains in session types

Linear logic (LL) has inspired the design of many computational systems,...

Strong Bisimulation for Control Operators

The purpose of this paper is to identify programs with control operators...

Choreographies as Functions

We propose a new interpretation of choreographies as functions, whereby ...

Distributive Laws for Monotone Specifications

Turi and Plotkin introduced an elegant approach to structural operationa...

Please sign up or login with your details

Forgot password? Click here to reset