The Community for Technology Leaders
RSS Icon
Subscribe
pp: 1
Ping Yang , State University of New York at Binghamton, Binghamton
Xing Xie , Colorado State University, Fort Collins
Indrakshi Ray , Colorado State University, Fort Collins
Shiyong Lu , Wayne State University, Detroit
ABSTRACT
Workflow security has become increasingly important and challenging in today's open service world. While much research has been conducted on various security issues of workflow systems, the workflow satisfiability problem, which asks whether a set of users together can complete a workflow, is recently identified as an important research problem that needs more investigation. In this paper, we study the computational complexity of the problem along two directions: one is by considering either one path or all paths of a workflow, and the other is by considering the possible patterns in a workflow. We further investigate the problem for access control policies with various constraints and workflows with different task constraints. We have shown that the general workflow satisfiability analysis problem is intractable. This complexity result motivates us to consider restrictions on workflow control-flow patterns and access control policies, and to identify tractable cases of practical interest.
INDEX TERMS
Security Analysis, Workflow
CITATION
Ping Yang, Xing Xie, Indrakshi Ray, Shiyong Lu, "Satisfiability Analysis of Workflows with Control-Flow Patterns and Authorization Constraints", IEEE Transactions on Services Computing, , no. 1, pp. 1, PrePrints PrePrints, doi:10.1109/TSC.2013.31
36 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool