Computation and automata
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
Modeling Behavior in Compositions of Software Architectural Primitives
Proceedings of the 19th IEEE international conference on Automated software engineering
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)
Automated Mapping of Reo Circuits to Constraint Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Modeling web service interactions using the coordination language Reo
WS-FM'07 Proceedings of the 4th international conference on Web services and formal methods
Comparing three coordination models: Reo, ARC, and PBRD
Science of Computer Programming
| Hi-index | 0.00 |
Reo is a language for exogenous coordination of component connectors based on a calculus of channels. Constraint automata has been proposed as Reo formal semantics. The corresponding constraint automata of a Reo circuit is compositionally constructed by the product of all the constituent constraint automata. We introduce a simple alternative algorithm for computing product of two constraint automata in this paper. We also give a greedy algorithm for finding the order of selection of two constraint automata when we have to compute product of more than two constraint automata. The order of our algorithm is less than the other algorithms proposed earlier by a constant factor. We propose an algebraic representation for constraint automata which our product algorithm is based on. Input and output of the provided tool are consistent with the other tools supporting Reo join and constraint automata product.