Modeling Component Connectors in Reo by Constraint Automata

Lecture Notes in Computer Science

2004

Self Cite

C e n t r u m v o o r W i s k u n d e e n I n f o r m a t i c aA Component-Based Parallel Constraint Solver ABSTRACT As a case study that illustrates our view on coordination and component-based software engineering, we present the design and implementation of a parallel constraint solver. The parallel solver coordinates autonomous instances of a sequential constraint solver, which is used as a software component. The component solvers achieve load balancing of tree search through a time-out mechanism. Experiments show that the purely exogenous mode of coordination employed here yields a viable parallel solver that effectively reduces turn-around time for constraint solving on a broad range of hardware platforms. Abstract. As a case study that illustrates our view on coordination and component-based software engineering, we present the design and implementation of a parallel constraint solver. The parallel solver coordinates autonomous instances of a sequential constraint solver, which is used as a software component. The component solvers achieve load balancing of tree search through a time-out mechanism. Experiments show that the purely exogenous mode of coordination employed here yields a viable parallel solver that effectively reduces turn-around time for constraint solving on a broad range of hardware platforms.

“…If a data item item can be forwarded on more than one output port, a non-deterministic choice is made. Construction of the exclusive router from Reo primitives is shown in [6].…”

Section: Parallel Solvermentioning

confidence: 99%

“…Reo [4,6] is a channel-based exogenous coordination model wherein complex coordinators, called connectors are compositionally built out of simpler ones. The simplest connectors in Reo are a set of channels with well defined behavior.…”

Section: Coordination and Abstract Behavior Typesmentioning

confidence: 99%

A Component-Based Parallel Constraint Solver

Zoeteweij

Lecture Notes in Computer Science

2004

Self Cite

“…Reo semantics have been defined in terms of two different formalisms: (timed) constraint automata and abstract behaviour types (not used here) [1,4]. In addition, a number of modal logics and model checking algorithms have been developed for specifying and checking properties of Reo circuits.…”

Section: Reasoning About Reo Modelsmentioning

confidence: 99%

“…Constraint automata A constraint automaton [4] is an automaton which describes the sequence of possible observations on the boundary nodes of a Reo connector. Such an automaton is defined over a set of names N = {A 1 , .…”

Section: Reasoning About Reo Modelsmentioning

confidence: 99%

See 1 more Smart Citation

Modelling Coordination in Biological Systems

Clarke

Costa

Leveraging Applications of Formal Methods

2006

Self Cite

C e n t r u m v o o r W i s k u n d e e n I n f o r m a t i c aModelling coordination in biological systems ABSTRACT We present an application of the Reo coordination paradigm to provide a compositional formal model for describing and reasoning about the behaviour of biological systems, such as regulatory gene networks. Reo governs the interaction and flow of data between components by allowing the construction of connector circuits which have a precise formal semantics. When applied to systems biology, the result is a graphical model, which is comprehensible, mathematically precise, and flexible. AbstractWe present an application of the Reo coordination paradigm to provide a compositional formal model for describing and reasoning about the behaviour of biological systems, such as regulatory gene networks. Reo governs the interaction and flow of data between components by allowing the construction of connector circuits which have a precise formal semantics. When applied to systems biology, the result is a graphical model, which is comprehensible, mathematically precise, and flexible.

Synthesis of Reo Circuits for Implementation of Component-Connector Automata Specifications

Lecture Notes in Computer Science

Baier

Boer

et al. 2005

Self Cite

C e n t r u m v o o r W i s k u n d e e n I n f o r m a t i c a Software ENgineeringSynthesis of Reo Circuits For Implementation Of Component-Connector Automata Specifications In component-based construction, this coordination becomes the responsibility of the glue-code language and its underlying run-time middle-ware. Reo offers an expressive gluelanguage for construction of coordinating component connectors out of primitive channels. In this paper we consider the problem of synthesizing Reo coordination code from a specification of a behavior as a relation on scheduled-data streams. The specification is given as a constraint automaton that describes the desired input/output behavior at the ports of the components. We present an algorithm that generates Reo code from a given constraint automaton. AbstractComposition of a concurrent system out of components involves coordination of their mutual interactions. In component-based construction, this coordination becomes the responsibility of the glue-code language and its underlying run-time middle-ware. Reo offers an expressive glue-language for construction of coordinating component connectors out of primitive channels. In this paper we consider the problem of synthesizing Reo coordination code from a specification of a behavior as a relation on scheduled-data streams. The specification is given as a constraint automaton that describes the desired input/output behavior at the ports of the components. We present an algorithm that generates Reo code from a given constraint automaton.