In this talk I will use notions from the theory of algebraic graph transformation (distribution and amalgamation) to model synchronized reconfiguration of connectors. The idea is that connectors consist of a number of wired black boxes and that a reconfiguration of the system is modeled by a set of of synchronized reconfiguration rules for each of the black boxes and the connector itself. Besides showing how these abstract notions can be used to model these distributed reconfigurations, we propose a strategy for executing these reconfigurations also in hierarchical settings, i.e. where black boxes consist again of a connector and more black boxes.

This is kind of a practice for a workshop talk to be held in June.