Validating reconfigurations of reo circuits in an e-Banking scenario

Authors:
Maurice H. ter Beek;Fabio Gadducci;Francesco Santini
Affiliations:
ISTI-CNR, Pisa, Italy;Department of Computer Science, Pisa, Italy;INRIA, Paris, France
Venue:
Proceedings of the 4th international ACM Sigsoft symposium on Architecting critical systems
Year:
2013

Citing 8
Cited 0

Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach

Handbook of graph grammars and computing by graph transformation
A graph transformation approach to software architecture reconfiguration

Science of Computer Programming - Special issue on applications of graph transformations (GRATRA 2000)
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)
Web services choreography and orchestration in Reo and constraint automata

Proceedings of the 2007 ACM symposium on Applied computing
Modeling dynamic reconfigurations in Reo using high-level replacement systems

Science of Computer Programming
Symbolic graphs for attributed graph constraints

Journal of Symbolic Computation
Reo + $${{\tt mCRL2}}$$: A framework for model-checking dataflow in service compositions

Formal Aspects of Computing

Quantified Score

Hi-index	0.00

Visualization

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.