Coordination languages and their significance
Communications of the ACM
Communication and Concurrency
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)
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
Synthesis of reo circuits for implementation of component-connector automata specifications
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Channel-based coordination via constraint satisfaction
Science of Computer Programming
A model of context-dependent component connectors
Science of Computer Programming
Decomposition of constraint automata
FACS'10 Proceedings of the 7th international conference on Formal Aspects of Component Software
Interactive specification and verification of behavioral adaptation contracts
Information and Software Technology
Dreams: a framework for distributed synchronous coordination
Proceedings of the 27th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
Port automata are an operational model for component connectors in a coordination language such as Reo. They describe which sets of ports can synchronize in each state of the connector being modelled. This paper presents decomposition theorems for port automata, namely that all (finite) port automata can be generated from a small set of primitive port automata. Applying these results to component connectors means that all component connectors can be constructed from just two primitive connectors.