Computing Publications

Publications Home » Typed Event Structures and the Pi...

Typed Event Structures and the Pi-Calculus

Daniele Valacca, Nobuko Yoshida

Conference or Workshop Paper
MFPS 2006, Twenty-second Conference on the Mathematical Foundations of Programming Semantics
Twenty-second Conference on the Mathematical Foundations of Programming Semantics
Volume 158
pp.373–398
May, 2006
Elsevier
ISSN 1571-0661
Abstract

We propose a typing system for the true concurrent model of event

structures that guarantees the interesting behavioural properties known

as \emph{conflict freeness} and

\emph{confusion freeness}. Conflict freeness is the true concurrent

version of the notion of confluence. A system is confusion free if

nondeterministic choices are localised and do not depend on the

scheduling of independent components.

Ours is the first

typing system to control behaviour in a true concurrent model.

To demonstrate its applicability,

we show that typed event structures give a semantics of

linearly typed version of the $\pi$-calculi with internal

mobility.

The semantics we provide is the first event structure semantics of

the $\pi$-calculus and generalises

Winskel's original event structure semantics of CCS.

BibTEX file for the publication
 

pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.