Connector colouring was devised as a way of determinining which "macro-step" of a connector to perform next, abstracting away from details such as "which state to go into". Connector colouring has served as a suitable basis for implementing connectors, but it still remains somewhat mysterious and problematic. This talk recasts connector colouring into a well-known formal framework, which enables finer distinctions to be made, and resolves a number of open issues. Furthermore, we hope that this formal work will enable a more thorough comparison between our notion of connector and somewhat similar systems such as Esterel and StateCharts.