Bounded and Approximate Strong Satisfiability in Workflows

@article{Crampton2019BoundedAA,
  title={Bounded and Approximate Strong Satisfiability in Workflows},
  author={Jason Crampton and Gregory Gutin and Diptapriyo Majumdar},
  journal={Proceedings of the 24th ACM Symposium on Access Control Models and Technologies},
  year={2019}
}
  • Jason Crampton, Gregory Gutin, Diptapriyo Majumdar
  • Published 2019
  • Computer Science, Mathematics
  • Proceedings of the 24th ACM Symposium on Access Control Models and Technologies
  • 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 makes it 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… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Explore key concepts

    Links to highly relevant papers for key concepts in this paper:

    Citations

    Publications citing this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-2 OF 2 REFERENCES

    Bounded and approximate strong satisfiability in workflows

    • J. Crampton, G. Gutin, D. Majumdar
    • CoRR abs/1904.07234
    • 2019
    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL