Title: Partial connector colouring
Authors: Clarke, Dave
Proenca, Jose #
Issue Date: 2012
Publisher: Springer
Host Document: COORDINATION vol:7274 pages:59-73
Series Title: Lecture Notes in Computer Science
Conference: COORDINATION edition:14 location:Sweeden date:14-15 June 2012
Abstract: 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.
ISBN: 978-3-642-30828-4
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Informatics Section
# (joint) last author

Files in This Item:
File Description Status SizeFormat
main.pdf Published 389KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.