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

Abstract

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.

Partially distributed coordination with Reo and constraint automata

“…Because the product of any number of single-state automata yields a single-state automaton, state space explosion will never occur. Even if we later decide to add a new primitive whose automaton has more than one state and which does not satisfy no-synchronization (such that it will not constitute its own subset), Baier et al have shown that we can always break the automaton of this new primitive down into a number of single-state automata and a number of FIFOs [3], as long as we assume a finite data domain.…”

“…In this case, a Reo expert designed this connector by hand. Alternatively, depending on the expertise available in an organization, one can specify the orchestration protocol as an automaton, as a Bpel program, or as a Uml sequence/activity diagram and use mechanical connector synthesis technology to obtain this (or a behaviorally equivalent) connector [3,17].…”

“…To actually run this case study on five machines, we use Amazon Web Services (Aws), 3 which is a collection of wss that together make up a Cloud computing platform, offered over the Internet by Amazon.com. In particular, we take advantage of Elastic Compute Cloud (Ec2): a ws that provides resizable compute capacity in the Cloud.…”

Büchi automata for modeling component connectors

“…2a. For more examples and a more detailed description of several other Reo circuits we refer to [1,2,6]. …”

“…Related works Much work has been done on constraint automata for the verification of properties of Reo circuits by model-checking [5], to synthesize Reo circuits and executable code from constraint automata [2], and to automatically compose constraint automata. Further, several extensions of constraint automata have been defined to cover probabilities [7], real-time [5], and other quality of services of connectors [3].…”