Compositional Analysis of Protocol Equivalence in the Applied $$\pi $$-Calculus Using Quasi-open Bisimilarity

Abstract

This paper shows that quasi-open bisimilarity is the coarsest bisimilarity congruence for the applied $$\pi $$ π -calculus. Furthermore, we show that this equivalence is suited to security and privacy problems expressed as an equivalence problem in the following senses: (1) being a bisimilarity is a safe choice since it does not miss attacks based on rich strategies; (2) being a congruence it enables a compositional approach to proving certain equivalence problems such as unlinkability; and (3) being the coarsest such bisimilarity congruence it can establish proofs of some privacy properties where finer equivalences fail to do so.

Bisimulations Respecting Duration and Causality for the Non-interleaving Applied π-Calculus

“…However, the main reason for these choices is simply to focus on the interleaving/non-interleaving spectrum. For example, it would be easy to define quasi-open variants of our non-interleaving semantics, which coincide with a testing semantics making use of all contexts [22].…”