Connector colouring provided an intuitive semantics of Reo connectors which lead to effective implementation techniques, first based on computing colouring tables directly, and later on encodings of colouring into constraints. One weakness of the framework is that it operates globally, giving a colouring to all primitives of the connector in lock-step, including those not involved in the interaction. This global approach limits both scalability and the available concurrency. This paper addresses these problems by introducing partiality into the connector colouring model. Partial colourings allow parts of a connector to operate independently and in isolation, increasing scalability and concurrency. © 2012 IFIP International Federation for Information Processing.
CITATION STYLE
Clarke, D., & Proença, J. (2012). Partial connector colouring. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7274 LNCS, pp. 59–73). https://doi.org/10.1007/978-3-642-30829-1_5
Mendeley helps you to discover research relevant for your work.