A fully abstract semantics for causality in the \(\pi\)-calculus (Q1130165)

We examine the meaning of causality in calculi for mobile processes like the \(\pi\)-calculus, and we investigate the relationship between interleaving and causal semantics for such calculi. We separate two forms of causal dependencies on actions of \(\pi\)-calculus processes, called subject and object dependencies: The former originate from the nesting of prefixes and are propagated through interactions among processes (they are the only form of causal dependencies present in CCS-like languages); the latter originate from the binding mechanisms on names. We propose a notion of causal bisimulation which distinguishes processes which differ for the subject or for the object dependencies. We show that this causal equivalence can be reconducted to, or implemented into, the ordinary interleaving observation equivalence. We prove that our encoding is fully abstract w.r.t. the two behavioural equivalences. This allows us to exploit the simpler theory of the interleaving semantics to reason about the causal one. In [\((*)\) \textit{D. Sangiorgi}, Theor. Comput. Sci. 155, No. 1, 39-83 (1996; Zbl 0874.68115)] a similar programme is carried out for location bisimulation [\textit{G. Boudol}, \textit{I. Castellani}, \textit{M. Hennessy} and \textit{A. Kiehn}, Formal Asp. Comput. 6, No. 2, 165-200 (1994; Zbl 0806.68070)], a noninterleaving spatial-sensitive (as opposed to causal-sensitive) behavioural equivalence. The comparison between the encodings of causal bisimulation in this paper, and of location bisimulation in \((*)\), evidences the similarities and the differences between these two equivalences.