Hostname: page-component-6898cfcb55-th4rj Total loading time: 0 Render date: 2026-11-11T16:56:31.790Z Has data issue: false hasContentIssue false
  • English
  • Français

On bisimulations for the spi calculus

Published online by Cambridge University Press:  27 May 2005

JOHANNES BORGSTRÖM and
UWE NESTMANN
JOHANNES BORGSTRÖM
Affiliation:
School of Computer and Communication Sciences, EPFL, 1015 Lausanne, Switzerland
UWE NESTMANN
Affiliation:
School of Computer and Communication Sciences, EPFL, 1015 Lausanne, Switzerland
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The spi calculus is an extension of the pi calculus with cryptographic primitives, which was designed for the verification of cryptographic protocols. Because of this extension, the naive adaptation of labelled bisimulations from the pi calculus is too strong to be useful for the purposes of verification. Instead, as a viable alternative, several ‘environment-sensitive’ bisimulations have been proposed. In this paper, we present a formal study of the differences between these bisimulations.

Information

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 15 , Issue 3 , June 2005, pp. 487 - 552
Copyright
2005 Cambridge University Press

Footnotes

This work was supported by the Swiss National Science Foundation, grants No. 21-65180.01 and 200020-101720.1. An extended abstract has appeared in the Proceedings of AMAST 2002, Springer-Verlag Lecture Notes in Computer Science2422