Results 1  10
of
74
Abstract behavior types: A foundation model for components and their composition
 SCIENCE OF COMPUTER PROGRAMMING
, 2003
"... ..."
(Show Context)
Modeling Component Connectors in Reo by Constraint Automata (Extended Abstract)
, 2004
"... Reo is an exogenous coordination language for compositional construction of component connectors based on a calculus of channels. Building automated tools to address such concerns as equivalence or containment of the behavior of two given connectors, verification of the behavior of a connector, etc. ..."
Abstract

Cited by 97 (37 self)
 Add to MetaCart
(Show Context)
Reo is an exogenous coordination language for compositional construction of component connectors based on a calculus of channels. Building automated tools to address such concerns as equivalence or containment of the behavior of two given connectors, verification of the behavior of a connector, etc. requires an operational semantic model suitable for model checking. In this paper we introduce constraint automata and propose them as a semantic model for Reo.
Algebraic specification and coalgebraic synthesis of Mealy machines
 In: Proceedings of FACS 2005. ENTCS
, 2006
"... We introduce the notion of functional stream derivative, generalising the notion of input derivative of rational expressions (Brzozowski 1964) to the case of stream functions over arbitrary input and output alphabets. We show how to construct Mealy automata from algebraically specified stream functi ..."
Abstract

Cited by 22 (11 self)
 Add to MetaCart
(Show Context)
We introduce the notion of functional stream derivative, generalising the notion of input derivative of rational expressions (Brzozowski 1964) to the case of stream functions over arbitrary input and output alphabets. We show how to construct Mealy automata from algebraically specified stream functions by the symbolic computation of functional stream derivatives. We illustrate this construction in full detail for various bitstream functions specified in the algebraic calculus of the 2adic numbers. This work is part of a larger ongoing effort to specify and model component connector circuits in terms of (functions and relations on) streams.
Models and Temporal Logics for Timed Component Connectors
 SEFM2004, 2nd International Conference on Software Engineering and Formal Methods
"... The coordination language Reo supports compositional system construction through connectors with realtime properties that exogenously coordinate the interactions among the constituent components into a coherent collaboration. In this paper, we present an operational semantics for the channelbase ..."
Abstract

Cited by 18 (8 self)
 Add to MetaCart
(Show Context)
The coordination language Reo supports compositional system construction through connectors with realtime properties that exogenously coordinate the interactions among the constituent components into a coherent collaboration. In this paper, we present an operational semantics for the channelbased component connectors of Reo in terms of Timed Constraint Automata and introduce a temporallogic for specification and verification of their realtime properties. 1.
Connector Colouring I: Synchronisation and Context Dependency
, 2006
"... Reo is a coordination model based on circuitlike connectors which coordinate components through the interplay of data flow, synchronisation and mutual exclusion, state, and contextdependent behaviour. This paper proposes a scheme based on connector colouring for determining the behaviour of a Reo ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
Reo is a coordination model based on circuitlike connectors which coordinate components through the interplay of data flow, synchronisation and mutual exclusion, state, and contextdependent behaviour. This paper proposes a scheme based on connector colouring for determining the behaviour of a Reo connector by resolving its context dependent synchronisation and mutual exclusion constraints. Colouring a Reo connector in a specific state with given boundary conditions (I/O requests) provides a means to determine the routing alternatives for data flow. Our scheme has the advantage over previous models in that it is simpler to implement and that it models Reo connectors more closely to their envisaged semantics than existing formal models.
Compositional construction of web services using Reo
 In Proc. International Workshop on Web Services: Modeling, Architecture and Infrastructure (ICEIS 2004
, 2004
"... CWI is a founding member of ERCIM, the European Research Consortium for Informatics and Mathematics. CWI's research has a themeoriented structure and is grouped into four clusters. Listed below are the names of the clusters and in parentheses their acronyms. ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
(Show Context)
CWI is a founding member of ERCIM, the European Research Consortium for Informatics and Mathematics. CWI's research has a themeoriented structure and is grouped into four clusters. Listed below are the names of the clusters and in parentheses their acronyms.
Specifying software connectors
 1st International Colloquium on Theorectical Aspects of Computing (ICTAC’04
, 2004
"... Abstract. Orchestrating software components, often independently supplied, has assumed a central role in software construction. Actually, as relevant as components themselves, are the ways in which they can be put together to interact and cooperate in order to achieve some common goal. Such is the r ..."
Abstract

Cited by 16 (9 self)
 Add to MetaCart
(Show Context)
Abstract. Orchestrating software components, often independently supplied, has assumed a central role in software construction. Actually, as relevant as components themselves, are the ways in which they can be put together to interact and cooperate in order to achieve some common goal. Such is the role of socalled software connectors: external coordination devices which ensure both the flow of data and synchronization restrictions within a component’s network. This paper introduces a new model for software connectors, based on relations extended in time, which aims to provide support for light intercomponent dependency and effective external control. 1
A.: Automata for contextdependent connectors
 In: COORDINATION 2009. LNCS
, 2009
"... Abstract. Recent approaches to componentbased software engineering employ coordinating connectors to compose components into software systems. For maximum flexibility and reuse, such connectors can themselves be composed, resulting in an expressive calculus of connectors whose semantics encompas ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
(Show Context)
Abstract. Recent approaches to componentbased software engineering employ coordinating connectors to compose components into software systems. For maximum flexibility and reuse, such connectors can themselves be composed, resulting in an expressive calculus of connectors whose semantics encompasses complex combinations of synchronisation, mutual exclusion, nondeterministic choice and statedependent behaviour. A more expressive notion of connector includes also contextdependent behaviour, namely, whenever the choices the connector can take change nonmonotonically as the context, given by the pending activity on its ports, changes. Context dependency can express notions of priority and inhibition. Capturing contextdependent behaviour in formal models is nontrivial, as it is unclear how to propagate context information through composition. In this paper we present an intuitive automatabased formal model of contextdependent connectors, and argue that it is superior to previous attempts at such a model for the coordination language Reo. 1
Component connectors with qos guarantees
 In Murphy and Vitek [46
"... Abstract. Connectors have emerged as a powerful concept for composition and coordination of concurrent activities encapsulated as components and services. Compositional coordination models and languages serve as a means to formally specify and implement component and service connectors. They support ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
(Show Context)
Abstract. Connectors have emerged as a powerful concept for composition and coordination of concurrent activities encapsulated as components and services. Compositional coordination models and languages serve as a means to formally specify and implement component and service connectors. They support largescale distributed applications by allowing construction of complex component connectors out of simpler ones. Modelling, analysis, and ensuring endtoend Quality of Service (QoS) represent key concerns in such largescale distributed applications. In this paper we introduce a compositional model of QoS, called Quantitative Constraint Automata, that reflects the underlying architecture of component/service composition represented by the Reo connector circuits. These can support compositional reasoning about component/service connectors, modelled as Reo circuits with QoS properties.
Symbolic model checking for channelbased component connectors
 In FOCLASA’06
, 2006
"... The paper reports on the foundations and experimental results with a model checker for component connectors modelled by networks of channels in the calculus Reo. The specification formalisms is a branching time logic that allows to reason about the coordination principles of and the data flow in the ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
(Show Context)
The paper reports on the foundations and experimental results with a model checker for component connectors modelled by networks of channels in the calculus Reo. The specification formalisms is a branching time logic that allows to reason about the coordination principles of and the data flow in the network. The underlying model checking algorithm relies on variants of standard automatabased approaches and model checking for CTLlike logics. The implementation uses a symbolic representation of the network and the enabled I/Ooperations by means of binary decision diagrams. It has been applied to a couple examples that illustrate the efficiency of our model checker.