View in EDS

A ground-complete axiomatization of stateless bisimilarity over Linda.

Saved in:
Bibliographic Details
Title: A ground-complete axiomatization of stateless bisimilarity over Linda.
Authors: Aceto, Luca1,2 luca@ru.is, Goriac, Eugen-Ioan3 eugen.goriac@me.com, Ingolfsdottir, Anna1 annai@ru.is
Source: Information Processing Letters. Feb2015, Vol. 115 Issue 2, p212-220. 9p.
Subjects: LINDA (Computer system), Programming languages, Algebra, Mathematical analysis, Information processing
Abstract: This paper offers a finite, ground-complete axiomatization of stateless bisimilarity over the tuple-space-based coordination language Linda. As stepping stones towards that result, axiomatizations of stateless bisimilarity over the sequential fragment of Linda without the nask primitive, and over the full sequential sub-language are given. It is also shown that stateless bisimilarity coincides with standard bisimilarity over the sequential fragment of Linda without the nask primitive. [ABSTRACT FROM AUTHOR]
Copyright of Information Processing Letters is the property of Elsevier B.V. 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 Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 99610839
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A ground-complete axiomatization of stateless bisimilarity over Linda.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Aceto%2C+Luca%22">Aceto, Luca</searchLink><relatesTo>1,2</relatesTo><i> luca@ru.is</i><br /><searchLink fieldCode="AR" term="%22Goriac%2C+Eugen-Ioan%22">Goriac, Eugen-Ioan</searchLink><relatesTo>3</relatesTo><i> eugen.goriac@me.com</i><br /><searchLink fieldCode="AR" term="%22Ingolfsdottir%2C+Anna%22">Ingolfsdottir, Anna</searchLink><relatesTo>1</relatesTo><i> annai@ru.is</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Information+Processing+Letters%22">Information Processing Letters</searchLink>. Feb2015, Vol. 115 Issue 2, p212-220. 9p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22LINDA+%28Computer+system%29%22">LINDA (Computer system)</searchLink><br /><searchLink fieldCode="DE" term="%22Programming+languages%22">Programming languages</searchLink><br /><searchLink fieldCode="DE" term="%22Algebra%22">Algebra</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+analysis%22">Mathematical analysis</searchLink><br /><searchLink fieldCode="DE" term="%22Information+processing%22">Information processing</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: This paper offers a finite, ground-complete axiomatization of stateless bisimilarity over the tuple-space-based coordination language Linda. As stepping stones towards that result, axiomatizations of stateless bisimilarity over the sequential fragment of Linda without the nask primitive, and over the full sequential sub-language are given. It is also shown that stateless bisimilarity coincides with standard bisimilarity over the sequential fragment of Linda without the nask primitive. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Information Processing Letters is the property of Elsevier B.V. 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=99610839
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.ipl.2014.09.014
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 9
        StartPage: 212
    Subjects:
      – SubjectFull: LINDA (Computer system)
        Type: general
      – SubjectFull: Programming languages
        Type: general
      – SubjectFull: Algebra
        Type: general
      – SubjectFull: Mathematical analysis
        Type: general
      – SubjectFull: Information processing
        Type: general
    Titles:
      – TitleFull: A ground-complete axiomatization of stateless bisimilarity over Linda.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Aceto, Luca
      – PersonEntity:
          Name:
            NameFull: Goriac, Eugen-Ioan
      – PersonEntity:
          Name:
            NameFull: Ingolfsdottir, Anna
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 02
              Text: Feb2015
              Type: published
              Y: 2015
          Identifiers:
            – Type: issn-print
              Value: 00200190
          Numbering:
            – Type: volume
              Value: 115
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Information Processing Letters
              Type: main
ResultId 1