Abstract
The workflow satisfiability problem is concerned with determining whether it is possible to find an allocation of authorized users to the steps in a workflow in such a way that all constraints are satisfied. The problem is NP-hard in general, but is known to be fixed-parameter tractable for certain classes of constraints. In this paper, we provide the first results that establish fixed-parameter tractability of the satisfiability problem when the constraints are asymmetric. We also establish a lower bound for the hardness of the workflow satisfiability problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Arnborg, S., Corneil, D., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods 8(2), 277–284 (1987)
Bodlaender, H.: A linear time algorithm for finding tree decompositions of small treewidth. SIAM J. Comput. 25, 1305–1317 (1996)
Bodlaender, H., Koster, A.: Treewidth computations I. Upper bounds. Information and Computation 208(3), 259–275 (2010)
Crampton, J., Crowston, R., Gutin, G., Jones, M., Ramanujan, M.: Fixed-parameter tractability of workflow satisfiability in the presence of seniority constraints. CoRR abs/1210.3978 (2012)
Crampton, J.: A reference monitor for workflow systems with constrained task execution. In: SACMAT 2005, pp. 38–47 (2005)
Crampton, J., Gutin, G.: Constraint Expressions and Workflow Satisfiability. In: SACMAT 2013 (to appear, 2013)
Crampton, J., Gutin, G., Yeo, A.: On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem. ACM Trans. Inform. System & Secur. (to appear), Preliminary version in. ACM Conf. Comput. & Communic. Secur., pp. 857–868 (2012)
Fellows, M.R., Friedrich, T., Hermelin, D., Narodytska, N., Rosamond, F.A.: Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable. Theor. Comput. Sci. 472, 81–89 (2013)
Flum, J., Grohe, M.: Parameterized Complexity Theory. In: Texts in Theoretical Computer Science. Springer (2006)
Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512–530 (2001)
Kloks, T. (ed.): Treewidth. Computations and Approximations. LNCS, vol. 842. Springer, Heidelberg (1994)
Marx, D.: Can you beat treewidth? Theory of Computing 6(1), 85–112 (2010)
Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)
Wang, Q., Li, N.: Satisfiability and resiliency in workflow authorization systems. ACM Trans. Inf. Syst. Secur. 13(4), 40 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Crampton, J., Crowston, R., Gutin, G., Jones, M., Ramanujan, M.S. (2013). Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints. In: Fellows, M., Tan, X., Zhu, B. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 7924. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38756-2_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-38756-2_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38755-5
Online ISBN: 978-3-642-38756-2
eBook Packages: Computer ScienceComputer Science (R0)