Name creation implements restriction in the π-calculus.

Saved in:
Bibliographic Details
Title: Name creation implements restriction in the π-calculus.
Authors: Kawabe, Yoshinobu1, Mano, Ken1, Horita, Eiichi2, Kogure, Kiyoshi3
Source: Systems & Computers in Japan. 2/1/2005, Vol. 36 Issue 2, p78-91. 14p.
Subjects: Abstract data types (Computer science), Calculus, Mathematical analysis, Mathematical functions, Telecommunication, Programming languages
Abstract: 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 (www.interscience.wiley.com). DOI 10.1002/scj.10302 [ABSTRACT FROM AUTHOR]
Copyright of Systems & Computers in Japan is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract: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 (<URL>www.interscience.wiley.com</URL>). DOI 10.1002/scj.10302 [ABSTRACT FROM AUTHOR]
ISSN:08821666
DOI:10.1002/scj.10302