12 search results - page 3 / 3 » Deciding Bisimilarity between BPA and BPP Processes |
LICS
1991
IEEE
13 years 8 months ago
1991
IEEE
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...
CSFW
2010
IEEE
13 years 8 months ago
2010
IEEE
We consider the problem of automating open bisimulation checking for the spi-calculus, an extension of the pi-calculus with cryptographic primitives. The notion of open bisimulatio...