A calculus of mobile processes, II
Information and Computation
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
A symbolic semantics for the &pgr;-calculus
Information and Computation
A calculus for cryptographic protocols
Information and Computation
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
A bisimulation method for cryptographic protocols
Nordic Journal of Computing
On Compositional Reasoning in the Spi-calculus
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Typed behavioural equivalences for processes in the presence of subtyping
Mathematical Structures in Computer Science
On bisimulations for the spi calculus
Mathematical Structures in Computer Science
Theoretical Computer Science
Model checking for π-calculus using proof search
CONCUR 2005 - Concurrency Theory
A Proof Search Specification of the π-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A Congruence Format for Name-passing Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
A formal semantics for protocol narrations
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
A trace based bisimulation for the spi calculus: an extended abstract
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
| Hi-index | 5.23 |
In the context of the @p-calculus, open bisimulation is prominent and popular due to its congruence properties and its easy implementability. Motivated by the attempt to generalise it to the spi-calculus, we offer a new, more refined definition and show how far it coincides with the original one.