Rigid Families for CCS and the π-calculus

Ioana Cristescu (1) , Jean Krivine (1) , Daniele Varacca (1)

1 PPS - Preuves, Programmes et Systèmes

This paper presents a novel causal semantics for concurrency, based on rigid families. Instead of having causality as primitive notion, in our model causality and concurrency are derived from precedence, a partial order local to each run of a process. We show that our causal semantics can interpret CCS and π-calculus terms. We propose some criteria to evaluate the correctness of a causal semantics of process calculi and we argue that none of the previous models for the π-calculus satisfy them all.

Domaines: Calcul parallèle, distribué et partagé [cs.DC]; Théorie et langage formel [cs.FL]

Ioana Cristescu, Jean Krivine, Daniele Varacca. Rigid Families for CCS and the π-calculus. 12th International Colloquium on Theoretical Aspects of Computing (ICTAC 2015), Oct 2015, Cali, Colombia. ⟨hal-01189062⟩