Symbolic Bisimulation for the Applied Pi Calculus

DOI10.1007/978-3-540-77050-3_11zbMath1135.94327OpenAlexW1539904031MaRDI QIDQ5458829

Stéphanie Delaune, Steve Kremer, Mark D. Ryan

Publication date: 24 April 2008

Published in: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77050-3_11

Mathematics Subject Classification ID

Cryptography (94A60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity ⋮ Deciding equivalence-based properties using constraint solving ⋮ Compositional equivalences based on open pNets ⋮ Computing strong and weak bisimulations for psi-calculi ⋮ A Complete Symbolic Bisimilarity for an Extended Spi Calculus ⋮ Symbolic Bisimulation for the Applied Pi Calculus

Cites Work

• Symbolic bisimulations
• Deciding knowledge in security protocols under equational theories
• On the symbolic reduction of processes with cryptographic functions.
• A symbolic semantics for the \(\pi\)-calculus
• Mobile values, new names, and secure communication
• CONCUR 2004 - Concurrency Theory
• Programming Languages and Systems
• Symbolic Bisimulation for the Applied Pi Calculus

This page was built for publication: Symbolic Bisimulation for the Applied Pi Calculus