Coordination languages form the glue for compenent composition.
Reo is one such coordination language whose "connectors" are circuits
built from primitive channels. This talk firstly gives an overview
of the Reo language and the tools for reasoning about Reo connectors.
In the second half of the talk, the Reo's reconfiguration sublanguage is
described. The talk will discuss the applications and pitfalls of
dynamic reconfiguration, as well as describing the extensions made to
the reasoning tools to handle dynamic reconfiguration.