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
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 15793700
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Name creation implements restriction in the π-calculus.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Kawabe%2C+Yoshinobu%22">Kawabe, Yoshinobu</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Mano%2C+Ken%22">Mano, Ken</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Horita%2C+Eiichi%22">Horita, Eiichi</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22Kogure%2C+Kiyoshi%22">Kogure, Kiyoshi</searchLink><relatesTo>3</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Systems+%26+Computers+in+Japan%22">Systems & Computers in Japan</searchLink>. 2/1/2005, Vol. 36 Issue 2, p78-91. 14p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Abstract+data+types+%28Computer+science%29%22">Abstract data types (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Calculus%22">Calculus</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+analysis%22">Mathematical analysis</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+functions%22">Mathematical functions</searchLink><br /><searchLink fieldCode="DE" term="%22Telecommunication%22">Telecommunication</searchLink><br /><searchLink fieldCode="DE" term="%22Programming+languages%22">Programming languages</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=15793700
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1002/scj.10302
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 14
        StartPage: 78
    Subjects:
      – SubjectFull: Abstract data types (Computer science)
        Type: general
      – SubjectFull: Calculus
        Type: general
      – SubjectFull: Mathematical analysis
        Type: general
      – SubjectFull: Mathematical functions
        Type: general
      – SubjectFull: Telecommunication
        Type: general
      – SubjectFull: Programming languages
        Type: general
    Titles:
      – TitleFull: Name creation implements restriction in the π-calculus.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Kawabe, Yoshinobu
      – PersonEntity:
          Name:
            NameFull: Mano, Ken
      – PersonEntity:
          Name:
            NameFull: Horita, Eiichi
      – PersonEntity:
          Name:
            NameFull: Kogure, Kiyoshi
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 02
              Text: 2/1/2005
              Type: published
              Y: 2005
          Identifiers:
            – Type: issn-print
              Value: 08821666
          Numbering:
            – Type: volume
              Value: 36
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Systems & Computers in Japan
              Type: main
ResultId 1