Partial Connector Colouring - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Partial Connector Colouring

(1, 2) , (1, 2)
1
2

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.
Fichier principal
Vignette du fichier
978-3-642-30829-1_5_Chapter.pdf (252.53 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01529589 , version 1 (31-05-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Dave Clarke, José Proença. Partial Connector Colouring. 14th International Conference on Coordination Models and Languages (COORDINATION), Jun 2012, Stockholm, Sweden. pp.59-73, ⟨10.1007/978-3-642-30829-1_5⟩. ⟨hal-01529589⟩
37 View
35 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More