Concurrent constraint programming
Concurrent constraint programming
Timed default concurrent constraint programming
Journal of Symbolic Computation - Special issue: executable temporal logics
Coordination of heterogeneous distributed cooperative constraint solving
ACM SIGAPP Applied Computing Review - Special issue on coodination languages and models
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
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
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Modeling component connectors in Reo by constraint automata
Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
Principles of Constraint Programming
Principles of Constraint Programming
Connector colouring I: Synchronisation and context dependency
Science of Computer Programming
From propositional satisfiability to satisfiability modulo theories
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Coordination: Reo, Nets, and Logic
Formal Methods for Components and Objects
Channel-based coordination via constraint satisfaction
Science of Computer Programming
Synthesizing glue operators from glue constraints for the construction of component-based systems
SC'11 Proceedings of the 10th international conference on Software composition
Formal modeling
A model of context-dependent component connectors
Science of Computer Programming
Compositional construction of real-time dataflow networks
COORDINATION'10 Proceedings of the 12th international conference on Coordination Models and Languages
Hi-index | 0.00 |
Coordination in Reo emerges from the composition of the behavioural constraints of the primitives, such as channels, in a component connector. Understanding and implementing Reo, however, has been challenging due to interaction of the channel metaphor, which is an inherently local notion, and the non-local nature of constraint propagation imposed by composition. In this paper, the channel metaphor takes a back seat, and we focus on the behavioural constraints imposed by the composition of primitives, and phrase the semantics of Reo as a constraint satisfaction problem. Not only does this provide a clear intensional description of the behaviour of Reo connectors in terms of synchronisation and data flow constraints, it also paves the way for new implementation techniques based on constraint propagation and satisfaction. In fact, decomposing Reo into constraints provides a new computational model for connectors, which we extend to model interaction with an unknown external world beyond what is currently possible in Reo.