Reconfiguring distributed Reo connectors

C. Koehler, F. Arbab, E.P. Vink, de

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

10 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationRecent Trends in Algebraic Development Techniques (19th International Workshop, WADT 2008, Pisa, Italy, June 13-16, 2008, Revised Selected Papers)
EditorsA. Corradini, U. Montanari
Place of PublicationBerlin
PublisherSpringer
Pages221-235
ISBN (Print)978-3-642-03428-2
DOIs
Publication statusPublished - 2009

Publication series

NameLecture Notes in Computer Science
Volume5486
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'Reconfiguring distributed Reo connectors'. Together they form a unique fingerprint.

Cite this