On the Satisfiability of Workflows with Release Points

There has been a considerable amount of interest in recent years in the problem of workflow satisfiability, which asks whether the existence of constraints in a workflow specification means that it is impossible to allocate authorized users to each step in the workflow. Recent developments have seen the workflow satisfiability problem (WSP) studied in the context of workflow specifications in which the set of steps may vary from one instance of the workflow to another. This, in turn, means that some constraints may only apply to certain workflow instances. Inevitably, WSP becomes more complex for such workflow specifications. In this paper, we present the first fixed parameter algorithms to solve WSP for workflow specifications of this type. Moreover, we significantly extend the range of constraints that can be used in workflow specifications of this type.

[1]  Ninghui Li,et al.  Satisfiability and Resiliency in Workflow Authorization Systems , 2010, TSEC.

[2]  Wil M. P. van der Aalst,et al.  Workflow Patterns , 2003, Distributed and Parallel Databases.

[3]  Yaakov L. Varol,et al.  On the Generation of All Topological Sortings , 1983, J. Algorithms.

[4]  Gregory Gutin,et al.  Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints , 2016, J. Artif. Intell. Res..

[5]  Gregory Gutin,et al.  Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints , 2015, FAW.

[6]  Charles Morisset,et al.  Quantitative Workflow Resiliency , 2014, ESORICS.

[7]  Russell Impagliazzo,et al.  Complexity of k-SAT , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[8]  David A. Basin,et al.  Obstruction-Free Authorization Enforcement: Aligning Security with Business Objectives , 2011, 2011 IEEE 24th Computer Security Foundations Symposium.

[9]  Wil M. P. van der Aalst,et al.  Workflow Patterns , 2004, Distributed and Parallel Databases.

[10]  Gregory Gutin,et al.  Algorithms for the workflow satisfiability problem engineered for counting constraints , 2015, Journal of Combinatorial Optimization.

[11]  Gregory Gutin,et al.  On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem , 2013, TSEC.

[12]  Michael R. Fellows,et al.  Fundamentals of Parameterized Complexity , 2013 .

[13]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[14]  Frank Ruskey,et al.  Generating Linear Extensions Fast , 1994, SIAM J. Comput..

[15]  Clara Bertolissi,et al.  Automated Synthesis of Run-time Monitors to Enforce Authorization Policies in Business Processes , 2015, AsiaCCS.

[16]  Michal Pilipczuk,et al.  Parameterized Algorithms , 2015, Springer International Publishing.

[17]  Stephen A. White,et al.  BPMN modeling and reference guide : understanding and using BPMN : develop rigorous yet understandable graphical representations of business processes , 2008 .

[18]  Gregory Gutin,et al.  Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis , 2016, Inf. Process. Lett..

[19]  Gregory Gutin,et al.  On the Workflow Satisfiability Problem with Class-Independent Constraints for Hierarchical Organizations , 2016, ACM Trans. Priv. Secur..

[20]  Gregory Gutin,et al.  Constraint expressions and workflow satisfiability , 2013, SACMAT '13.

[21]  Jason Crampton.  A reference monitor for workflow systems with constrained task execution , 2005, SACMAT '05.

[22]  Doron Rotem,et al.  An Algorithm to Generate all Topological Sorting Arrangements , 1981, Computer/law journal.

[23]  Elisa Bertino,et al.  The specification and enforcement of authorization constraints in workflow management systems , 1999, TSEC.

[24]  Indrakshi Ray,et al.  Satisfiability Analysis of Workflows with Control-Flow Patterns and Authorization Constraints , 2014, IEEE Transactions on Services Computing.

[25]  Gregory Gutin,et al.  Digraphs - theory, algorithms and applications , 2002 .

[26]  Gregory Gutin,et al.  Iterative Plan Construction for the Workflow Satisfiability Problem , 2013, J. Artif. Intell. Res..

[27]  R. Diestel.  Extremal Graph Theory , 2017 .

[28]  Jayme Luiz Szwarcfiter,et al.  A Structured Program to Generate all Topological Sorting Arrangements , 1974, Information Processing Letters.