A Workflow Criticality-Based Approach to Bypass the Workflow Satisfiability Problem

被引:3
|
作者
Boughrous, Monsef [1 ]
El Bakkali, Hanan [1 ]
机构
[1] Mohammed V Univ Rabat, Rabat It Ctr, Smart Syst Lab SSL, ENSIAS, Rabat, Morocco
关键词
MODEL;
D O I
10.1155/2021/3330923
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Workflow management systems are very important for any organization to manage and model complex business processes. However, significant work is needed to keep a workflow resilient and secure. Therefore, organizations apply a strict security policy and enforce access control constraints. As a result, the number of available and authorized users for the workflow execution decreases drastically. Thus, in many cases, such a situation leads to a workflow deadlock situation, where there no available authorized user-task assignments for critical tasks to accomplish the workflow execution. In the literature, this problem has gained interest of security researchers in the recent years, and is known as the workflow satisfiability problem (WSP). In this paper, we propose a new approach to bypass the WSP and to ensure workflow resiliency and security. For this purpose, we define workflow criticality, which can be used as a metric during run-time to prevent WSP. We believe that the workflow criticality value will help workflow managers to make decisions and start a mitigation solution in case of a critical workflow. Moreover, we propose a delegation process algorithm (DP) as a mitigation solution that uses workflow instance criticality, delegation, and priority concepts to find authorized and suitable users to perform the critical task with low-security risks.
引用
收藏
页数:15
相关论文
共 50 条
  • [21] Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints
    Cohen, David
    Crampton, Jason
    Gagarin, Andrei
    Gutin, Gregory
    Jones, Mark
    FRONTIERS IN ALGORITHMICS, FAW 2014, 2014, 8497 : 48 - 59
  • [22] On the Workflow Satisfiability Problem with Class-Independent Constraints for Hierarchical Organizations
    Crampton, Jason
    Gagarin, Andrei
    Gutin, Gregory
    Jones, Mark
    Wahlstrom, Magnus
    ACM TRANSACTIONS ON PRIVACY AND SECURITY, 2016, 19 (03)
  • [23] Satisfiability and Resiliency in Workflow Authorization Systems
    Wang, Qihua
    Li, Ninghui
    ACM TRANSACTIONS ON INFORMATION AND SYSTEM SECURITY, 2010, 13 (04)
  • [24] Minimum Incremental Pattern Backtracking for Resource-independent Workflow Satisfiability Problem
    Zhai Z.-N.
    Lu Y.-H.
    Liu G.-J.
    Lei J.-S.
    Xiang J.
    Wu M.-W.
    Ruan Jian Xue Bao/Journal of Software, 2023, 34 (04): : 1543 - 1569
  • [25] A workflow process mining approach based on dynamic workflow net
    Zhou, B
    Wang, JY
    Proceedings of the 11th Joint International Computer Conference, 2005, : 682 - 685
  • [26] Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints
    Karapetyan, Daniel
    Gagarin, Andrei
    Gutin, Gregory
    FRONTIERS IN ALGORITHMICS (FAW 2015), 2015, 9130 : 138 - 149
  • [27] Maintenance management for geographically distributed assets: a criticality-based approach
    Manco, Pasquale
    Rinaldi, Marta
    Caterino, Mario
    Fera, Marcello
    Macchiaroli, Roberto
    RELIABILITY ENGINEERING & SYSTEM SAFETY, 2022, 218
  • [28] Reduced incremental pattern backtracking for workflow satisfiability
    Zhai Z.
    Liu G.
    Lu Y.
    Xiang J.
    Wu M.
    Feng M.
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2023, 29 (11): : 3624 - 3638
  • [29] Counting Workflow Satisfiability(≠, =) and Its #P Completeness
    Zhai Z.-N.
    Lu Y.-H.
    Yu F.-H.
    Zhou W.-J.
    Xiang J.
    Wu M.-W.
    Yu, Fa-Hong (fhyu520@126.com), 1600, Chinese Institute of Electronics (45): : 605 - 611
  • [30] Criticality-Based Advice in Reinforcement Learning
    Spielberg, Yitzhak
    Azaria, Amos
    THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2022, : 13057 - 13058