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 |
