Reconfiguring Distributed Reo Connectors

Authors:
Christian Koehler;Farhad Arbab;Erik Vink
Affiliations:
CWI, Amsterdam, The Netherlands 1090;CWI, Amsterdam, The Netherlands 1090;Technische Universiteit Eindhoven, Eindhoven, The Netherlands
Venue:
Recent Trends in Algebraic Development Techniques
Year:
2009

Citing 0
Cited 4

Automata for Context-Dependent Connectors

COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
Modeling dynamic reconfigurations in Reo using high-level replacement systems

Science of Computer Programming
Synthesis of Reo circuits from scenario-based interaction specifications

Science of Computer Programming
Puff, the magic protocol

Formal modeling

Quantified Score

Hi-index	0.00

Visualization

Abstract

The coordination language Reo defines circuit-like connectors to steer the collaboration of independent components. In this paper, we present a framework for the modeling of distributed, self-reconfigurable connectors based on algebraic graph transformations. Reconfiguring a connector that is composed with others, may involve a change of shared interfaces and may therefore require a reconfiguration of the surrounding connectors as well. We present a method of synchronized local reconfigurations in this setting and discuss a bottom-up strategy for coordinating synchronized reconfigurations in a connector network. We exploit the double-pushout approach for the modeling of reconfigurations, and propose an adaptation of the concept of amalgamation for synchronizing reconfigurations. We use a nondeterministic scheduler as our running example.