An overview of Manifold and its implementation
Concurrency: Practice and Experience
Component Software: Beyond Object-Oriented Programming
Component Software: Beyond Object-Oriented Programming
A Complete Axiomatisation for Trace Congruence of Finite State Behaviors
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
Hierarchical Concurrent Finite State Machines in Ptolemy
CSD '98 Proceedings of the 1998 International Conference on Application of Concurrency to System Design
The Ptolemy II Framework for Visual Languages
HCC '01 Proceedings of the IEEE 2001 Symposia on Human Centric Computing Languages and Environments (HCC'01)
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
A basic algebra of stateless connectors
Theoretical Computer Science - Algebra and coalgebra in computer science
Towards a Coordination Model for Interactive Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
The Algebra of Connectors—Structuring Interaction in BIP
IEEE Transactions on Computers
Automata for Context-Dependent Connectors
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
CIRC: a circular coinductive prover
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
A decision procedure for bisimilarity of generalized regular expressions
SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
A model of context-dependent component connectors
Science of Computer Programming
| Hi-index | 0.00 |
Recent approaches to component-based software engineering employ coordinating connectors to compose components into software systems. Reo is a model of component coordination, wherein complex connectors are constructed by composing various types of primitive channels. Reo automata are a simple and intuitive formal model of context- dependent connectors, which provided a compositional semantics for Reo. In this paper, we study Reo automata from a coalgebraic perspective. This enables us to apply the recently developed coalgebraic theory of generalized regular expressions in order to derive a specification language, tailor-made for Reo automata, and sound and complete axiomatizations with respect to three distinct notions of equivalence: (coalgebraic) bisimilarity, the bisimulation notion studied in the original papers on Reo automata and trace equivalence. The obtained language is simple, but nonetheless expressive enough to specify all possible finite Reo automata. Moreover, it comes equipped with a Kleene-like theorem: we provide algorithms to translate expressions to Reo automata and, conversely, to compute an expression equivalent to a state in a Reo automaton.