Synthesis of Reo Circuits for Implementation of Component-Connector Automata Specifications
- Cite this paper as:
- Arbab F., Baier C., de Boer F., Rutten J., Sirjani M. (2005) Synthesis of Reo Circuits for Implementation of Component-Connector Automata Specifications. In: Jacquet JM., Picco G.P. (eds) Coordination Models and Languages. COORDINATION 2005. Lecture Notes in Computer Science, vol 3454. Springer, Berlin, Heidelberg
Composition 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. The main contribution in this paper is an algorithm that generates Reo code from a given constraint automaton.
Unable to display preview. Download preview PDF.