The Connector Colouring Semantic Model aims at facilitate the data-flow computation (and implementation) of Reo connectors in a distributed computing environment. On our previous talk we presented the motivation and informally introduced and explained the connector colouring model working out the data-flow behaviour of some Reo connectors. Now, on this talk, we proceed describing the formalization of the model and we present some examples of Reo connectors now formally describe and how their data-flow behaviour are calculated.

If time allows us we shall also introduce Intentional Constraint Automata (IntCA). IntCA extends Constraint automata (CA) to capture all the different possible ways a component can interact with a Reo connector. A connector performs (I) I/O-operation requests on the connector's ports. Depending on the specification and actual configuration of the connector I/O-operations requests can: (II) be accepted and the I/O operation succeeds; (III) wait until either the connector evolves to a configuration in which this waiting operation can succeed or; (IV) time-out. CA models of Reo connectors capture only the behaviour (II) of succeeding I/O-operations. Arrival of requests (I); and I/O-operations that later succeed (III) or timeout (IV) are omitted from the CA model. These omitted steps however affect the behaviour of a connector in various ways as described in the informal operational semantics of Reo and are therefore too important to be left out of the model. IntCA extends CA to include aspects (I), (II) and (IV) into the model. The utility of IntCA and CA will be briefly discussed and compared.