Validating reconfigurations of reo circuits in an e-Banking scenario
Pages 39 - 48
Abstract
We formalize dynamic reconfiguration of Reo circuits (which can be thought of as multi-party communication infrastructures built from primitive channels) through graph transformation, and apply it to a scenario from the Finance domain: a critical infrastructure controlling the business process of an e-banking system. In this scenario, reconfiguration is triggered as soon as the communication buffers reach specific predefined thresholds of congestion. These constraints are implemented inside the Reo model by associating suitable predicates to channels, thus extending previous results on the use of graph transformation for the reconfiguration of Reo's graphical structures.
References
[1]
F. Arbab. Reo: a channel-based coordination model for component composition. Mathematical Structures in Computer Science, 14(3):329--366, 2004.
[2]
C. Baier, M. Sirjani, F. Arbab, and J. Rutten. Modeling component connectors in Reo by constraint automata. Science of Computer Programming, 61(2):75--113, 2006.
[3]
C. Brandt and F. Hermann. Conformance Analysis of Organizational Models: A New Enterprise Modeling Framework using Algebraic Graph Transformation. International Journal of Information System Modeling and Design, 4(1), 2013.
[4]
C. Brandt, F. Santini, N. Kokash, and F. Arbab. Modeling and Simulation of Selected Operational IT Risks in the Banking Sector. In M. Klumpp, editor, European Simulation and Modelling Conference, pages 192--200. EUROSIS-ETI, 2012.
[5]
A. Corradini, U. Montanari, F. Rossi, H. Ehrig, R. Heckel, and M. Lowe. Algebraic Approaches to Graph Transformation - Part I: Basic Concepts and Double Pushout Approach. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation, volume 1: Foundations, pages 163--245. World Scientific, 1997.
[6]
S.-S. Jongmans and F. Arbab. Overview of Thirty Semantic Formalisms for Reo. Scientific Annals of Computer Science, 22(1):201--251, 2012.
[7]
N. Kokash, C. Krause, and E. P. de Vink. Reo + mCRL2: A framework for model-checking dataflow in service compositions. Formal Aspects of Computing, 24(2):187--216, 2012.
[8]
C. Krause. Distributed Port Automata. In F. Gadducci and L. Mariani, editors, Graph Transformation and Visual Modeling Techniques, volume 41 of Electronic Communications of the EASST. EASST, 2011.
[9]
C. Krause, H. Giese, and E. P. de Vink. Compositional and behavior-preserving reconfiguration of component connectors in Reo. Journal of Visual Languages & Computing, 24(3), 2013.
[10]
C. Krause, Z. Maraikar, A. Lazovik, and F. Arbab. Modeling dynamic reconfigurations in Reo using high-level replacement systems. Science of Computer Programming, 76(1):23--36, 2011.
[11]
S. Meng and F. Arbab. Web Services Choreography and Orchestration in Reo and Constraint Automata. In Y. Cho, R. L. Wainwright, H. M. Haddad, S. Y. Shin, and Y. W. Koo, editors, Symposium on Applied Computing, pages 346--353. ACM, 2007.
[12]
F. Orejas. Symbolic graphs for attributed graph constraints. Journal of Symbolic Computation, 46(3):294--315, 2011.
[13]
M. Wermelinger and J. L. Fiadeiro. A graph transformation approach to software architecture reconfiguration. Science of Computer Programming, 44(2):133--155, 2002.
Index Terms
- Validating reconfigurations of reo circuits in an e-Banking scenario
Recommendations
Modeling dynamic reconfigurations in Reo using high-level replacement systems
Reo is a channel-based coordination language, wherein circuit-like connectors model and implement interaction protocols in heterogeneous environments that coordinate components or services. Connectors are constructed from primitive channels and can be ...
Connector Rewriting with High-Level Replacement Systems
Reo is a language for coordinating autonomous components in distributed environments. Coordination in Reo is performed by circuit-like connectors, which are constructed from primitive channels with well-defined behavior. These channels are mobile, i.e. ...
Reasoning about software reconfigurations
Software connectors encapsulate interaction patterns between services in complex, distributed service-oriented applications. Such patterns encode the interconnection between the architectural elements in a system, which is not necessarily fixed, but ...
Comments
Information & Contributors
Information
Published In
June 2013
68 pages
Copyright © 2013 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 17 June 2013
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Comparch '13
Sponsor:
Comparch '13: Federated Events on Component-Based Software Engineering and Software Architecture
June 17 - 21, 2013
British Columbia, Vancouver, Canada
Acceptance Rates
ISARCS '13 Paper Acceptance Rate 7 of 12 submissions, 58%;
Overall Acceptance Rate 14 of 30 submissions, 47%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 57Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 20 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in