Constraint automata have been used as an operational model for Reo which offers a channel-based framework to compose complex component connectors. In this paper, we introduce a variant of constraint automata with discrete probabilities and nondeterminism, called probabilistic constraint automata. These can serve for compositional reasoning about connector components, modelled by Reo circuits wi...

Coordination in Reo emerges from the composition of the behavioural constraints of primitives, such as channels, in a component connector. Understanding and implementing Reo, however, has been challenging due to the interaction of the channel metaphor, which is an inherently local notion, and the non-local nature of the constraints imposed by composition. In this paper, the channel metaphor tak...

Reo is a coordination language which can be used to model the interactions among a set of components or services in a compositional manner using connectors. The language concepts of Reo include synchronization, mutual exclusion, data manipulation, memory and contextdependency. Context-dependency facilitates the precise specification of a connector’s possible actions in situations where it would...

Behaviour Types The original semantics of Reo is defined in terms of abstract behaviour types [8], which are co-inductively defined relations over timed data streams (a timed stream paired with a value stream). These models account for synchronisation, dataflow, and, implicitly, state changes. They mention neither context dependency nor reconfiguration. This semantics provide little guidance fo...

The hypothesis is presented that bacteriophage DNA packaging motors have a cycle comprised of bind/release thermal ratcheting with release-associated DNA pushing via ATP-dependent protein folding. The proposed protein folding occurs in crystallographically observed peptide segments that project into an axial channel of a protein 12-mer (connector) that serves, together with a coaxial ATPase mul...

In this paper we introduce constraint automata and propose them as an operational model for Reo, an exogenous coordination language for compositional construction of component connectors based on a calculus of channels. By providing composition operators for constraint automata and defining notions of equivalence and refinement relations for them, this paper covers the foundations for building ...

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 c...

Coordination in Reo emerges from the composition of the behavioural constraints of the primitives, such as channels, in a component connector. Understanding and implementing Reo, however, has been challenging due to interaction of the channel metaphor, which is an inherently local notion, and the non-local nature of constraint propagation imposed by composition. In this paper, the channel metap...