Analysis of Secure Collaboration Plans for Multiple Workflow Processes With Timed Dynamic Relations and Shared Users
提出一种新方法，分析具有定时动态关系和共享用户的多工作流流程的安全协作计划，通过计算模式、下一代参数化发芽图来获得最优计划，比现有方法更高效。
In the field of workflow management, a recent hot research point is to analyze secure collaboration plans of multiple workflow processes with dynamic relations and shared users. However, existing research works neither consider the time limits of timed dynamic relations (<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">TDR</i>s), nor analyze the delayed time of activities caused by shared users. In this article, we propose a new approach to analyzing secure collaboration plans of multiple workflow processes with <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">TDR</i>s and user conflicts: 1) we propose the computing patterns for basic structures in workflow processes with <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">TDR</i>s and shared users; 2) we develop the next-generation parametric sprouting graph (NPSG) based on the above patterns; and 3) we obtain the optimal secure collaboration plan based on NPSG. Compared with the existing methods, our approach can effectively deal with the problem of collaboration plans with <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">TDR</i>s and shared users. Furthermore, our approach is more efficient, because NPSG of multiple workflow processes can be constructed in parallel and its recommendation ability is improved by deleting invalid paths in advance.