%0 Conference Proceedings
%T Lifting Low-Level Workflow Changes Through User-Defined Graph-Rule-Based Patterns
%+ University of Kassel
%A Jahl, Alexander
%A Baraki, Harun
%A Tran, Huu, Tam
%A Kuppili, Ramaprasad
%A Geihs, Kurt
%Z Part 3: Roaming in Graph (Graph Processing)
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 17th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS)
%C Neuchâtel, Switzerland
%Y Lydia Y. Chen
%Y Hans Reiser
%I Springer International Publishing
%3 Distributed Applications and Interoperable Systems
%V LNCS-10320
%P 115-128
%8 2017-06-19
%D 2017
%R 10.1007/978-3-319-59665-5_8
%K Graph transformation
%K Graph matching
%K Pattern matching
%K Change Impact Analysis
%K Dependency graph
%K Web services
%K Service evolution
%K Answer set programming
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X In dynamic service-oriented architectures, services and service compositions underlie constant evolution that may not only affect the own workflow but dependent services too. Subsequently, required adaptations necessitate an effective detection of the changes and their effects. Merely capturing a sequence of low-level changes and analyzing each of them demands much coordination and may lead to an incomplete picture. An abstraction that summarizes a combination of low-level changes will facilitate the detection and reduce the number of changes that shall be considered for adaptation. In this paper, we propose an abstraction that is formulated through graph-based patterns, since service compositions are workflows that can be mapped to directed labeled graphs. The characteristics and granularity of a graph pattern can be adjusted by domain experts to the respective workflow language and application case. In particular, graph-based patterns are crucial when workflows are represented in two different formats. This could be the case if there exists one representation for the execution and one for the verification. We present implementation details and a detailed example that shows the feasibility and simplicity of our solution.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01800121/document
%2 https://inria.hal.science/hal-01800121/file/450046_1_En_8_Chapter.pdf
%L hal-01800121
%U https://inria.hal.science/hal-01800121
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-DAIS
%~ IFIP-DISCOTEC
%~ IFIP-LNCS-10320