On the Expressiveness of Linda-like Concurrent Languages

Brogi, Antonio; Jacquet, Jean-Marie

doi:10.1016/s1571-0661(04)00118-5

Cited by 24 publications

(16 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, an interesting direction for future research is the development of a complete axiomatization for the notion of behavioural equivalence over Linda studied in [6].…”

Section: Discussionmentioning

confidence: 99%

“…(Our presentation follows those given in [6,19].) Moreover, we introduce the notion of stateless bisimilarity and the basic definitions from equational logic used in this paper.…”

Section: Preliminariesmentioning

confidence: 99%

“…Following [6], the signature Σ P for Linda is implicitly given by the BNF grammar defining the set T(Σ P ) of open process terms over a countably infinite set V P of process variables:…”

Section: Preliminariesmentioning

confidence: 99%

“…For instance, the relative expressive power of fragments of Linda has been studied in [6] and the paper [10] studies testing semantics, in the sense of De Nicola and Hennessy [9], over applicative and imperative process algebras that are inspired by Linda. The paper [9] also provides complete inequational axiomatizations of the studied calculi with respect to testing semantics.…”

mentioning

confidence: 99%

See 3 more Smart Citations

A ground-complete axiomatization of stateless bisimilarity over Linda

Aceto

Goriac

Ingólfsdóttir

2015

Information Processing Letters

View full text Add to dashboard Cite

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 sublanguage are given. It is also shown that stateless bisimilarity coincides with standard bisimilarity over the sequential fragment of Linda without the nask primitive.

show abstract

“…In particular, an interesting direction for future research is the development of a complete axiomatization for the notion of behavioural equivalence over Linda studied in [6].…”

Section: Discussionmentioning

confidence: 99%

“…(Our presentation follows those given in [6,19].) Moreover, we introduce the notion of stateless bisimilarity and the basic definitions from equational logic used in this paper.…”

Section: Preliminariesmentioning

confidence: 99%

“…Following [6], the signature Σ P for Linda is implicitly given by the BNF grammar defining the set T(Σ P ) of open process terms over a countably infinite set V P of process variables:…”

Section: Preliminariesmentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

A ground-complete axiomatization of stateless bisimilarity over Linda

Aceto

Goriac

Ingólfsdóttir

2015

Information Processing Letters

View full text Add to dashboard Cite

show abstract

“…A very complete study on the expressive power of Linda was made by Brogi and Jacquet in [6,7] where different Linda-like concurrent languages were compared by using the notion of modular embedding [5]. On the other hand, when Reo was introduced, Arbab [2] provided a number of examples to show the expressive power of his proposal, simulating in a simple and elegant way different communication mechanisms.…”

Section: Introductionmentioning

confidence: 99%

A Preliminary Comparative Study on the Expressive Power of Reo and Linda

Amaro

Pimentel

Roldán

2007

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

Component-based Software Development is an emerging discipline in the field of Software Engineering. In this context, coordination languages may be used to specify the interactive behavior of software components, and most of the proposals presented in the literature are based on shared data-space models, as Linda. On the other hand, a new model for coordination based on communication channels (Reo) is also emerging, and we argue it also can be used to describe component protocols in a very elegant way. Making a comparative analysis on the expressiveness of this channel based model and Linda is the main objective of the present work, which presents a first step to make an exhaustive formal study. Thus, in this paper we provide a couple of modular embeddings for the synchronous case and the asynchronous case by defining a common formalism in order to allow the comparison of both models at an homogeneous level of abstraction. We hope these results will help us to develop a complete study about the Reo's expressiveness, and to define an interaction description language based on Reo for component coordination, as it has already made in the context of Linda.

show abstract

On the Expressiveness of Coordination Models

Brogi

Jacquet

1999

Coordinatio Languages and Models

View full text Add to dashboard Cite

On the Expressiveness of Linda-like Concurrent Languages

Cited by 24 publications

References 16 publications

A ground-complete axiomatization of stateless bisimilarity over Linda

A ground-complete axiomatization of stateless bisimilarity over Linda

A Preliminary Comparative Study on the Expressive Power of Reo and Linda

On the Expressiveness of Coordination Models

Contact Info

Product

Resources

About