On bisimulations for the spi calculus

DOI10.1017/S0960129505004706zbMath1077.18004OpenAlexW2088500281MaRDI QIDQ5462665

Uwe Nestmann, Johannes Borgström

Publication date: 3 August 2005

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129505004706

zbMATH Keywords

cryptographybisimulationpi calculusspi calculus

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categorical semantics of formal languages (18C50)

Related Items (8)

Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity ⋮ Formalising Observer Theory for Environment-Sensitive Bisimulation ⋮ When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus ⋮ Implementing Spi Calculus Using Nominal Techniques ⋮ A Testing Theory for a Higher-Order Cryptographic Language ⋮ Open bisimulation, revisited ⋮ A Complete Symbolic Bisimilarity for an Extended Spi Calculus ⋮ Encoding cryptographic primitives in a calculus with polyadic synchronisation

This page was built for publication: On bisimulations for the spi calculus