From a semantic perspective, the reconfiguration features of Reo have not yet been explored. This talk presents their semantics in terms of sequences of constraint automata. In addition, a logic for reasoning about Reo connectors in the presence of reconfiguration is described. Interestingly, the logic is decideable, although its underlying model is infinite. The talk also discusses applications and pitfalls of dynamic reconfiguration.