On bisimulations for the spi calculus
From MaRDI portal
Publication:5462665
DOI10.1017/S0960129505004706zbMath1077.18004MaRDI 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
68P25: Data encryption (aspects in computer science)
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
18C50: Categorical semantics of formal languages
Related Items
A Complete Symbolic Bisimilarity for an Extended Spi Calculus, Encoding cryptographic primitives in a calculus with polyadic synchronisation, Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity, Open bisimulation, revisited, A Testing Theory for a Higher-Order Cryptographic Language, Formalising Observer Theory for Environment-Sensitive Bisimulation, Implementing Spi Calculus Using Nominal Techniques