LAUSR

Currently, recommending collaboration plans of dynamic multiple workflow processes under security requirements or constraints has become a hot topic, as it not only can reduce the risk during execution, but also can avoid enormous financial loss caused by security breaches. However, the existing methods cannot solve the parametric problem caused by dynamic relations of multiple workflow processes or recommend an optimal collaboration plan because of erroneous information. In this article, we propose a new approach to recommend security-aware collaboration plans for multiple workflow processes with dynamic relations. First, we develop three basic computing patterns of dynamic relations and construct a parametric sprouting graph for multiple workflow processes with dynamic relations. Second, we present the procedure of recommending an optimal secure collaboration plan that satisfy security requirements. By comparison with the existing methods via two experiments, our approach not only can solve the parametric problem caused by dynamic relations of multiple workflow processes, but also can recommend an optimal secure collaboration plan under security requirements.