Deciding framed bisimilarity

MaRDI QIDQ2842870zbMATH OpenFDO

Authors Hans Hüttel

Publication date 16 August 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066104805309

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1507234
• On bisimulations for the spi calculus
• On bisimulations for the spi calculus
• A calculus for cryptographic protocols: The spi calculus
• CONCUR 2004 - Concurrency Theory

Cites work

• A calculus for cryptographic protocols: The spi calculus
• A calculus of mobile processes. II
• A complexity analysis of bisimilarity for value-passing processes
• A theory of bisimulation for the -calculus
• Basic observables for processes
• scientific article; zbMATH DE number 1223723 (Why is no real title available?)
• scientific article; zbMATH DE number 1251177 (Why is no real title available?)
• scientific article; zbMATH DE number 1296290 (Why is no real title available?)
• scientific article; zbMATH DE number 1507234 (Why is no real title available?)
• scientific article; zbMATH DE number 1759624 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• On bisimulations for the spi calculus
• On the decidability of process equivalences for the \(\pi\)-calculus

Cited in

(11)

• Open bisimulation, revisited
• Implementing Spi Calculus Using Nominal Techniques
• Challenges in the Automated Verification of Security Protocols
• scientific article; zbMATH DE number 1507234 (Why is no real title available?)
• Analysing privacy-type properties in cryptographic protocols (invited talk)
• A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
• A complete symbolic bisimilarity for an extended spi calculus
• Decidable fragments of a higher order calculus with locations
• Automated verification of equivalence properties of cryptographic protocols
• On bisimulations for the spi calculus
• Automating security analysis: symbolic equivalence of constraint systems

This page was built for publication: Deciding framed bisimilarity

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