Name creation implements restriction in the π-calculus
Yoshinobu Kawabe, Ken Mano, Eiichi Horita, Kiyoshi Kogure · Systems and Computers in Japan · 2005
The π-calculus is a process algebra that is capable of expressing the dynamic connection of communication links between processes. In this paper, we describe a methodology for implementing the communication links necessary for implementing the π-calculus. In the π-calculus, the communication links are formalized using the notion of name restriction, while in the implementation communication links are easily handled by name creation. No formal proof is given for their equivalence. Moreover, for the π-calculus augmented with data types, there is a counterexample of the equivalence. In this paper, we argue the restriction under which the equivalence holds for the π-calculus augmented with data types. © 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(2): 78–91, 2005; Published online in Wiley InterScience (). DOI 10.1002sscj.10302