Skip to main content
Log in

Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

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. The wsp is, in fact, the conservative constraint satisfaction problem (i.e., for each variable, here called task, we have a unary authorization constraint) and is, thus, \(\mathsf {NP}\)-complete. It was observed by Wang and Li (ACM Trans Inf Syst Secur 13(4):40, 2010) that the number \(k\) of tasks is often quite small and so can be used as a parameter, and several subsequent works have studied the parameterized complexity of wsp regarding parameter \(k\). We take a more detailed look at the kernelization complexity of wsp( \(\varGamma \)) when \(\varGamma \) denotes a finite or infinite set of allowed constraints. Our main result is a dichotomy for the case that all constraints in \(\varGamma \) are regular: (1) We are able to reduce the number \(n\) of users to \(n'\le k\). This entails a kernelization to size poly\((k)\) for finite \(\varGamma \), and, under mild technical conditions, to size poly\((k+m)\) for infinite \(\varGamma \), where \(m\) denotes the number of constraints. (2) Already wsp( \(R\)) for some \(R\in \varGamma \) allows no polynomial kernelization in \(k+m\) unless the polynomial hierarchy collapses.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Notes

  1. The term partial kernel was first used in [4].

  2. Such reductions are of interest by themselves as some practical wsp algorithms iterate over users in search for a valid plan [5].

References

  1. American National Standards Institute. ANSI INCITS 359-2004 for role based access control (2004)

  2. Bertino, E., Bonatti, P.A., Ferrari, E.: TRBAC: a temporal role-based access control model. ACM Trans. Inf. Syst. Secur. 4(3), 191–233 (2001)

    Article  Google Scholar 

  3. Bertino, E., Ferrari, E., Atluri, V.: The specification and enforcement of authorization constraints in workflow management systems. ACM Trans. Inf. Syst. Secur. 2(1), 65–104 (1999)

    Article  Google Scholar 

  4. Betzler, N., Bredereck, R., Niedermeier, R.: Partial kernelization for rank aggregation: theory and experiments. In: IPEC, volume 6478 of LNCS, pp. 26–37. Springer (2010)

  5. Cohen, D., Crampton, J., Gagarin, A., Gutin, G., Jones, M.: Engineering algorithms for workflow satisfiability problem with user-independent constraints. In: FAW 2014, volume 8497 of LNCS, pp. 48–59. Springer (2014)

  6. Cohen, D., Crampton, J., Gagarin, A., Gutin, G., Jones, M.: Iterative plan construction for the workflow satisfiability problem. J. Artif. Intell. Res. 51, 555–577 (2014)

    MathSciNet  MATH  Google Scholar 

  7. Crampton, J.: A reference monitor for workflow systems with constrained task execution. In: SACMAT, pp. 38–47. ACM (2005)

  8. Crampton, J., Crowston, R., Gutin, G., Jones, M., Ramanujan, M.S.: Fixed-parameter tractability of workflow satisfiability in the presence of seniority constraints. In: FAW-AAIM, volume 7924 of LNCS, pp. 198–209. Springer (2013)

  9. Crampton, J., Gutin, G., Yeo, A.: On the parameterized complexity and kernelization of the workflow satisfiability problem. ACM Trans. Inf. Syst. Secur. 16(1), 4 (2013)

    Article  Google Scholar 

  10. Dell, H., van Melkebeek, D.: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. J. ACM 61(4), 23 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  11. Dom, M., Lokshtanov, D., Saurabh, S.: Kernelization lower bounds through colors and ids. ACM Trans. Algorithms 11(2), 13 (2014)

    Article  MathSciNet  Google Scholar 

  12. Downey, Rodney G., Fellows, Michael R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, Berlin (2013)

    Book  MATH  Google Scholar 

  13. Hermelin, D., Kratsch, S., Soltys, K., Wahlström, M., Wu, X.: A completeness theory for polynomial (Turing) kernelization. In: IPEC, volume 8246 of LNCS, pp. 202–215. Springer (2013)

  14. Joshi, J., Bertino, E., Latif, U., Ghafoor, A.: A generalized temporal role-based access control model. IEEE Trans. Knowl. Data Eng. 17(1), 4–23 (2005)

    Article  Google Scholar 

  15. Lokshtanov, D., Misra, N., Saurabh, S.: Kernelization—preprocessing with a guarantee. In: The Multivariate Algorithmic Revolution and Beyond, volume 7370 of LNCS, pp. 129–161. Springer (2012)

  16. Sandhu, R.S., Coyne, E.J., Feinstein, H.L., Youman, C.E.: Role-based access control models. IEEE Comput. 29(2), 38–47 (1996)

    Article  Google Scholar 

  17. Wang, Q., Li, N.: Satisfiability and resiliency in workflow authorization systems. ACM Trans. Inf. Syst. Secur. 13(4), 40 (2010)

    Article  Google Scholar 

Download references

Acknowledgments

Our research was partially supported by EPSRC Grant EP/K005162/1. We are grateful to the referees for their useful comments and suggestions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Stefan Kratsch.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gutin, G., Kratsch, S. & Wahlström, M. Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem. Algorithmica 75, 383–402 (2016). https://doi.org/10.1007/s00453-015-9986-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-015-9986-9

Keywords

Navigation