Logo des Repositoriums
 

Modeling and verifying dynamic communication structures based on graph transformations

dc.contributor.authorHenkler, Stefan
dc.contributor.authorHirsch, Martin
dc.contributor.authorPriesterjahn, Claudia
dc.contributor.authorSchäfer, Wilhelm
dc.contributor.editorEngels, Gregor
dc.contributor.editorLuckey, Markus
dc.contributor.editorSchäfer, Wilhelm
dc.date.accessioned2019-02-20T09:38:41Z
dc.date.available2019-02-20T09:38:41Z
dc.date.issued2010
dc.description.abstractCurrent and especially future software systems increasingly exhibit socalled self* properties (e. g. , self healing or self optimization). In essence, this means that software in such systems needs to be reconfigurable at runtime to remedy a detected failure or to adjust to a changing environment. Reconfiguration includes adding or deleting software components as well as adding or deleting component interaction. As a consequence, the state space of self* systems becomes so complex, that current verification approaches like model checking or theorem proving usually do not scale. Our approach addresses this problem by first defining a so-called “regular” system architecture with clearly defined interfaces and predefined patterns of communication such that dependencies between concurrently running component interactions are minimized with respect to the system under construction. The construction of such architectures and especially its reconfiguration is controlled by using graph transformation rules which define all possible reconfigurations. It is formally proven that such a rule set cannot produce any “non-regular” architecture. Then, the verification of safety and liveness properties has to be carried out for only an initially and precisely defined set of so-called coordination patterns rather than on the whole system.en
dc.identifier.isbn978-3-88579-253-6
dc.identifier.pissn1617-5468
dc.identifier.urihttps://dl.gi.de/handle/20.500.12116/20219
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofSoftware Engineering 2010
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-159
dc.titleModeling and verifying dynamic communication structures based on graph transformationsen
dc.typeText/Conference Paper
gi.citation.endPage164
gi.citation.publisherPlaceBonn
gi.citation.startPage153
gi.conference.date22.-26. Februar 2010
gi.conference.locationPaderbon
gi.conference.sessiontitleRegular Research Papers

Dateien

Originalbündel
1 - 1 von 1
Lade...
Vorschaubild
Name:
153.pdf
Größe:
242.9 KB
Format:
Adobe Portable Document Format