Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
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)
Q-Automata: Modelling the Resource Usage of Concurrent Components
Electronic Notes in Theoretical Computer Science (ENTCS)
Connector Rewriting with High-Level Replacement Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Using Reo for Service Coordination
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
Comparing three coordination models: Reo, ARC, and PBRD
Science of Computer Programming
Formal modeling
Symbolic execution of Reo circuits using constraint automata
Science of Computer Programming
Hi-index | 0.00 |
Coordination in SOA addresses dynamic topologies of interactions among services. Most efforts up to now have been focused on statically defined composition of services, e.g., using BPEL. To the best of our knowledge, there are no serious means to address the issues of dynamic coordination to accommodate continuously changing requirements. While BPEL is a powerful standard for service composition, it lacks support for typical coordination constraints, like synchronisation, mutual exclusion, and context-dependency.