On the reduction of chocs bisimulation to pi-calculus bisimulation
Abstract
Chocs and p-calculus are two extensions of CCS where, respectively processes and channels are transmissible values. In previous work we have proposed a formalization of the notion of bisimulation for Chocs. In this paper we suggest a more effective way to reason about this notion by means of a translation of Chocs into a variant of the p-calculus