Iterative Plan Construction for the Workflow Satisfiability Problem

@article{Cohen2014IterativePC,
  title={Iterative Plan Construction for the Workflow Satisfiability Problem},
  author={David A. Cohen and Jason Crampton and Andrei V. Gagarin and Gregory Gutin and Mark Jones},
  journal={J. Artif. Intell. Res.},
  year={2014},
  volume={51},
  pages={555-577}
}
  • David A. Cohen, Jason Crampton, +2 authors Mark Jones
  • Published in J. Artif. Intell. Res. 2014
  • Computer Science
  • The Workflow Satisfiability Problem (WSP) is a problem of practical interest that arises whenever tasks need to be performed by authorized users, subject to constraints defined by business rules. We are required to decide whether there exists a plan - an assignment of tasks to authorized users - such that all constraints are satisfied. It is natural to see the WSP as a subclass of the Constraint Satisfaction Problem (CSP) in which the variables are tasks and the domain is the set of users. What… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 26 CITATIONS

    Constraint Branching in Workflow Satisfiability Problem

    VIEW 9 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    A Survey on Workflow Satisfiability, Resiliency, and Related Problems

    VIEW 4 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis

    VIEW 4 EXCERPTS
    CITES BACKGROUND & METHODS

    Valued Workflow Satisfiability Problem

    VIEW 9 EXCERPTS
    CITES BACKGROUND & METHODS

    The Workflow Satisfiability Problem with User-Independent Constraints

    • Gregory Gutin
    • Computer Science
    • 2019 First International Conference on Graph Computing (GC)
    • 2019
    VIEW 4 EXCERPTS
    CITES BACKGROUND

    On Run-Time Enforcement of Authorization Constraints in Security-Sensitive Workflows

    VIEW 3 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 60 REFERENCES

    and A

    • J. Crampton, G. Gutin
    • Yeo. On the parameterized c omplexity and kernelization of the workflow satisfiability problem.ACM Trans. Inform. System & Secur. , 16(1):4
    • 2013
    VIEW 18 EXCERPTS
    HIGHLY INFLUENTIAL

    Satisfiability and Resiliency in Workflow Authorization Systems

    VIEW 9 EXCERPTS
    HIGHLY INFLUENTIAL

    and M

    • D. Cohen, J. Crampton, A. Gagarin, G. Gutin
    • Jones . Engineering algorithms for workflow satisfiability problem with user-independent cons traints. InFAW
    • 2014
    VIEW 2 EXCERPTS

    and M

    • D. Cohen, J. Crampton, A. Gagarin, G. Gutin
    • Jones . Engineering algorithms for workflow satisfiability problem with user-independent cons traints. InFAW
    • 2014
    VIEW 2 EXCERPTS