A complete symbolic bisimulation for full applied pi calculus

DOI10.1016/j.tcs.2012.07.034zbMath1277.68196MaRDI QIDQ1758155

Jia Liu, Huimin Lin

Publication date: 8 November 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.07.034

zbMATH Keywords

symbolic semantics; symbolic bisimulation; applied pi calculus

Mathematics Subject Classification ID

94A60: Cryptography

68Q55: Semantics in the theory of computing

68Q60: Specification and verification (program logics, model checking, etc.)

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

Related Items

On the existence and decidability of unique decompositions of processes in the applied \(\pi\)-calculus, Stateful applied pi calculus: observational equivalence and labelled bisimilarity

Cites Work

• A method for symbolic analysis of security protocols
• Symbolic bisimulations
• Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus.
• Proof systems for message-passing process algebras
• Private authentication
• A symbolic semantics for the \(\pi\)-calculus
• Automated verification of selected equivalences for security protocols
• Psi-calculi: a framework for mobile processes with nominal data and logic
• Proof System for Applied Pi Calculus
• A Complete Symbolic Bisimulation for Full Applied Pi Calculus
• Extended pi-Calculi
• A Complete Symbolic Bisimilarity for an Extended Spi Calculus
• Mobile values, new names, and secure communication
• CONCUR 2004 - Concurrency Theory