Typed Event Structures and the linear pi-calculus - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2010

Typed Event Structures and the linear pi-calculus

Résumé

We propose a typing system for the true concurrent model of event structures that guarantees the interesting behavioural properties known as conflict freeness and 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 π-calculi with internal mobility. The semantics we provide is the first event structure semantics of the π-calculus and generalises Winskel's original event structure semantics of CCS.
Fichier non déposé

Dates et versions

hal-00496903 , version 1 (01-07-2010)

Identifiants

  • HAL Id : hal-00496903 , version 1

Citer

Daniele Varacca, Nobuko Yoshida. Typed Event Structures and the linear pi-calculus. Theoretical Computer Science, 2010, 411 (19), pp.1949-1973. ⟨hal-00496903⟩
23 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More