A Complete Symbolic Bisimulation for Full Applied Pi Calculus
From MaRDI portal
Publication:3401115
DOI10.1007/978-3-642-11266-9_46zbMath1274.68242MaRDI QIDQ3401115
Publication date: 28 January 2010
Published in: SOFSEM 2010: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11266-9_46
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Automated Verification of Equivalence Properties of Cryptographic Protocols, Deciding equivalence-based properties using constraint solving, Computing strong and weak bisimulations for psi-calculi, A complete symbolic bisimulation for full applied pi calculus, Compositional equivalences based on open pNets