Article

Compatibility of Linda-based Component Interfaces.

Electr. Notes Theor. Comput. Sci 01/2002; 66:82-96. DOI:10.1016/S1571-0661(04)80451-1
Source: DBLP

ABSTRACT Linda is a coordination language, originally presented as a set of inter-agent communication primitives which can virtually be added to any programming language. In this paper, we analyse the use of Linda to specify the interactive behaviour of software components. We first introduce a process algebra for Linda and we define a notion of process compatibility that ensures the safe composition of components. In particular, we prove that compatibility implies successful computation. We also argue that Linda features some advantages with respect to similar proposals in the context of dynamic compatibility checking. In this perspective, we propose an alternative definition of compatibility that takes into account the state of a global store, which gives some relevant information about the current execution of the system.

0 0
 · 
0 Bookmarks
 · 
18 Views
  • [show abstract] [hide abstract]
    ABSTRACT: Coordination model facilitates the composition of components by separating the coordination aspects of an application from its computation aspects. In this paper we present a probabilistic coordination language based on the Linda model to describe the dynamic composition of components. In the language, sequence composition, parallel composition, conditional choice and probabilistic choice are defined. Operational semantics of the language is given. Finally, we demonstrate the language with an example.
    TASE 2009, Third IEEE International Symposium on Theoretical Aspects of Software Engineering, 29-31 July 2009, Tianjin, China; 01/2009
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: 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.
    Electronic Notes in Theoretical Computer Science. 01/2007;
  • [show abstract] [hide abstract]
    ABSTRACT: Service discovery and adaptation are two relevant paradigms in systems developed by assembling reusable software services accessed through their public interfaces. On one hand, the discovery process aims at discovering the most suitable services for a request. On the other hand, the adaptation process solves, as automatically as possible, mismatch cases which may be given at the different interoperability levels among interfaces by generating a mediating adaptor based on an adaptation contract. In this paper, we present an approach which takes advantage of context-awareness features and semantic-based mechanisms to discover services and adapt themselves to their environments.
    Internet and Web Applications and Services (ICIW), 2010 Fifth International Conference on; 06/2010

Full-text

View
0 Downloads
Available from