A transition system semantics for the control-driven coordination language MANIFOLD
Theoretical Computer Science
Proof, language, and interaction
Network Algebra
Distributed Algorithms
MoCha: A Middleware Based on Mobile Channels
COMPSAC '02 Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
Abstract behavior types: a foundation model for components and their composition
Science of Computer Programming - Formal methods for components and objects pragmatic aspects and applications
Complete axioms for stateless connectors
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
A basic algebra of stateless connectors
Theoretical Computer Science - Algebra and coalgebra in computer science
Connector Rewriting with High-Level Replacement Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Building Mashups for the Enterprise with SABRE
ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
Modeling and analysis of Reo connectors using alloy
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Comparing three coordination models: Reo, ARC, and PBRD
Science of Computer Programming
| Hi-index | 0.00 |
Reo is a coordination model based on circuit-like connectors which coordinate components through the interplay of data flow, synchronisation and mutual exclusion, state, and context-dependent behaviour. This paper proposes a scheme based on connector colouring for determining the behaviour of a Reo connector by resolving its synchronisation and exclusion constraints. Colouring a Reo connector in a specific state with given boundary conditions (I/O requests) provides a means to determine the routing alternatives for data flow. Our scheme has the advantage over previous models in that it is simpler to implement and that it models Reo connectors more closely to their envisaged semantics than existing formal models.