Law-governed interaction: a coordination and control mechanism for heterogeneous distributed systems
ACM Transactions on Software Engineering and Methodology (TOSEM)
Distributed and Parallel Databases
Coordination as Comstrainted Interaction (Extended Abstract)
COORDINATION '96 Proceedings of the First International Conference on Coordination Languages and Models
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
Choreographies: using Constraints to Satisfy Service Requests
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
A basic algebra of stateless connectors
Theoretical Computer Science - Algebra and coalgebra in computer science
Connector colouring I: Synchronisation and context dependency
Science of Computer Programming
Symbolic Model Checking for Channel-based Component Connectors
Electronic Notes in Theoretical Computer Science (ENTCS)
Automata for Context-Dependent Connectors
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
Recent Trends in Algebraic Development Techniques
Representations of Petri net interactions
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Channel-based coordination via constraint satisfaction
Science of Computer Programming
Encoding context-sensitivity in Reo into non-context-sensitive semantic models
COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages
Synthesizing glue operators from glue constraints for the construction of component-based systems
SC'11 Proceedings of the 10th international conference on Software composition
| Hi-index | 0.00 |
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.