Theoretical Computer Science
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
System architecture: the context for scenario-based model synthesis
Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of 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)
Synthesis of Connectors from Scenario-Based Interaction Specifications
CBSE '08 Proceedings of the 11th International Symposium on Component-Based Software Engineering
SAT-based Verification for Timed Component Connectors
Electronic Notes in Theoretical Computer Science (ENTCS)
Data-aware design and verification of service compositions with Reo and mCRL2
Proceedings of the 2010 ACM Symposium on Applied Computing
Time and Data-Aware Analysis of Graphical Service Models in Reo
SEFM '10 Proceedings of the 2010 8th IEEE International Conference on Software Engineering and Formal Methods
A semantic model for service composition with coordination time delays
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Compositional construction of real-time dataflow networks
COORDINATION'10 Proceedings of the 12th international conference on Coordination Models and Languages
| Hi-index | 0.00 |
The Reo coordination language is an extensible graphical notation for component or service coordination wherein independent autonomous software entities exchange data through a connector or a network imposing synchronization and data constraints on those entities. Each connector is formed from a set of binary connectors, called channels, with precise semantics and, thus, amenable to formal verification. However, the development of verification tools for Reo-specific semantic models, namely, constraint automata with its multiple extensions to represent quality of service, time constraints, context-dependent or probabilistic behavior would require years of research and development. A much more promising approach is to exploit already existing verification tools. In this paper, we present a mapping of timed Reo networks to networks of timed automata used for system specification in Uppaal. Uppaal is a state-of-the-art toolset for modeling, validation and verification of real-time systems used in many large-scale industrial projects. Our work enables its application to the compositional analysis of timed service-based workflow models specified with Reo.