Synthesis of reo circuits for implementation of component-connector automata specifications
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. We present an algorithm that generates Reo code from a given constraint automaton.
|Distributed Systems (acm C.2.4), Concurrent Programming (acm D.1.3), Software/Program Verification (acm D.2.4), Programming Environments (acm D.2.6), Languages (acm D.2.1.1), Tools (acm D.2.1.3), Language Classifications (acm D.3.2), Language Constructs and Features (acm D.3.3), Modes of Computation (acm F.1.2), Specifying and Verifying and Reasoning about Programs (acm F.3.1), Semantics of Programming Languages (acm F.3.2), Studies of Program Constructs (acm F.3.3)|
|Software (theme 1)|
|Software Engineering [SEN]|
Arbab, F, Baier, C, de Boer, F.S, Rutten, J.J.M.M, & Sirjani, M. (2004). Synthesis of reo circuits for implementation of component-connector automata specifications. Software Engineering [SEN]. CWI.