Abstract
The workflow satisfiability problem (WSP) is a planning problem. Certain sub-classes of this problem have been shown to be fixed-parameter tractable. In this paper we develop an implementation of an algorithm for WSP that has been shown, in our previous paper, to be fixed-parameter for user-independent constraints. In a set of computational experiments, we compare our algorithm to an encoding of the WSP into a pseudo-Boolean SAT problem solved by the well-known solver SAT4J. Our algorithm solves all instances of WSP generated in our experiments, unlike SAT4J, and it solves many instances faster than SAT4J. For lightly constrained instances, SAT4J usually outperforms our algorithm.
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
Berend, D., Tassa, T.: Improved bounds on Bell numbers and on moments of sums of random variables. Probability and Mathematical Statistics 30(2), 185–205 (2010)
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)
Chimani, M., Klein, K.: Algorithm engineering: Concepts and practice. In: Bartz-Beielstein, T., Chiarandini, M., Paquete, L., Preuss, M. (eds.) Experimental Methods for the Analysis of Optimization Algorithms, pp. 131–158 (2010)
Cohen, D., Crampton, J., Gagarin, A., Gutin, G., Jones, M.: Iterative plan construction for the workflow satisfiability problem. CoRR abs/1306.3649 (2013)
Crampton, J.: A reference monitor for workflow systems with constrained task execution. In: Ferrari, E., Ahn, G.J. (eds.) SACMAT, pp. 38–47. ACM (2005)
Crampton, J., Gutin, G.: Constraint expressions and workflow satisfiability. In: Conti, M., Vaidya, J., Schaad, A. (eds.) SACMAT, pp. 73–84. ACM (2013)
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)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)
Durstenfeld, R.: Algorithm 235: Random permutation. Communications of the ACM 7(7), 420 (1964)
Fisher, R.A., Yates, F.: Statistical tables for biological, agricultural and medical research, 3rd edn. Oliver and Boyd (1948)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)
Le Berre, D., Parrain, A.: The SAT4J library, release 2.2. J. Satisf. Bool. Model. Comput. 7, 59–64 (2010)
Myrvold, W., Kocay, W.: Errors in graph embedding algorithms. J. Comput. Syst. Sci. 77(2), 430–438 (2011)
Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford U. Press (2006)
Reingold, E.M., Nievergelt, J., Deo, N.: Combinatorial algorithms: Theory and practice. Prentice Hall (1977)
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
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Cohen, D., Crampton, J., Gagarin, A., Gutin, G., Jones, M. (2014). Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints. In: Chen, J., Hopcroft, J.E., Wang, J. (eds) Frontiers in Algorithmics. FAW 2014. Lecture Notes in Computer Science, vol 8497. Springer, Cham. https://doi.org/10.1007/978-3-319-08016-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-08016-1_5
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08015-4
Online ISBN: 978-3-319-08016-1
eBook Packages: Computer ScienceComputer Science (R0)