Symbolic Bisimulation for the Applied Pi Calculus

DOI10.1007/978-3-540-77050-3_11MaRDI QIDQ5458829zbMATH OpenOpenAlexFDO

Authors Stéphanie Delaune, Steve Kremer, M. 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

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

Recommendations

• A complete symbolic bisimulation for full applied pi calculus
• A complete symbolic bisimulation for full applied pi-calculus
• CONCUR 2004 - Concurrency Theory
• A symbolic semantics for the \(\pi\)-calculus
• Proof system for applied pi calculus

Cites work

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

Cited in

(23)

• A complete symbolic bisimulation for full applied pi calculus
• A symbolic semantics for the \(\pi\)-calculus
• Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity
• Stateful applied pi calculus: observational equivalence and labelled bisimilarity
• Compositional equivalences based on open pNets
• Proof system for applied pi calculus
• Formalising Observer Theory for Environment-Sensitive Bisimulation
• A complete symbolic bisimulation for full applied pi-calculus
• A Probabilistic Applied Pi–Calculus
• A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
• Efficient Bisimilarities from Second-Order Reaction Semantics for π-Calculus
• On Bisimulation Theory in Linear Higher-Order π-Calculus
• Deciding equivalence-based properties using constraint solving
• Computing strong and weak bisimulations for psi-calculi
• A complete symbolic bisimilarity for an extended spi calculus
• CONCUR 2004 - Concurrency Theory
• Encoding cryptographic primitives in a calculus with polyadic synchronisation
• Symbolic Bisimulation for the Applied Pi Calculus
• When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus
• On bisimulations for the asynchronous π-calculus
• Bisimulations respecting duration and causality for the non-interleaving applied \(\pi\)-calculus
• A pure labeled transition semantics for the applied pi calculus
• Open bisimilarity for the -calculus with mismatch

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458829)