Abstract. Service-based systems should be able to dynamically seek replacements for faulty or underperforming services, thus performing self-healing. It may however be the case that available services do not match all requirements, leading the system to grind to a halt. In similar situations it would be better to choose alternative candidates which, while not fulfilling all the constraints, allow the system to proceed. Soft constraints, instead of the traditional crisp constraints, can help naturally model and solve replacement problems of this sort. In this work we apply soft constraints to model SLAs and to decide how to rebuild compositions which may not satisfy all the requirements, in order not to completely stop running systems.

Recent researches have proposed to retrieve relevant fragments out from whole business processes to build new ones. Although they avoid building business processes from scratch, this task has been performed independently for each process, thus, making resulting fragments handling complicated. In this paper, we propose to merge some given business process fragments in order to facilitate the fragment-based business process design. At the same time, the obtained fragment must keep the behavior of original fragments so as to avoid paths execution blockage while the obtained fragments are integrated as part of a complete process. Our approach presents a systematic merge revolving around the so-called adjacency matrices. Typically used to handle graphs, this mechanism is adapted to business process fragments. We also present some rules to provide the obtained fragments with the behavior of original fragments and avoid inconsistent behaviors that were newly added after the merge.

No abstract

Two major concerns are emerging, while dealing with building new process functionalities: shortening the development periods and eliminating the risks related to sensitive information leakages and privacy breaches. Indeed, managing business processes in a modern fashion may increase their quality. An effective solution consists in reusing specific fragments of existing business processes. Moreover, the produced fragments need to be declared as safe from a privacy perspective.This paper presents a design-time approach to decomposing existing business processes. This approach provides ready-for-reuse and privacy-aware fragments that are conform to given semantics specifications. It is based on the so-called FCA technique handling semantic clustering while dealing with the privacy constraints.

No abstract