Algorithms for the workflow satisfiability problem engineered for counting constraints

DOI10.1007/S10878-015-9877-7zbMATH Open1354.90105arXiv1504.02420OpenAlexW2037376972MaRDI QIDQ328681FDOQ328681

Authors: David Cohen, J. Crampton, Andrei Gagarin, G. Gutin, M. Jones 

Publication date: 20 October 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Abstract: The workflow satisfiability problem (WSP) asks whether there exists an assignment of authorized users to the steps in a workflow specification that satisfies the constraints in the specification. The problem is NP-hard in general, but several subclasses of the problem are known to be fixed-parameter tractable (FPT) when parameterized by the number of steps in the specification. In this paper, we consider the WSP with user-independent counting constraints, a large class of constraints for which the WSP is known to be FPT. We describe an efficient implementation of an FPT algorithm for solving this subclass of the WSP and an experimental evaluation of this algorithm. The algorithm iteratively generates all equivalence classes of possible partial solutions until, whenever possible, it finds a complete solution to the problem. We also provide a reduction from a WSP instance to a pseudo-Boolean SAT instance. We apply this reduction to the instances used in our experiments and solve the resulting PB SAT problems using SAT4J, a PB SAT solver. We compare the performance of our algorithm with that of SAT4J and discuss which of the two approaches would be more effective in practice.

Full work available at URL: https://arxiv.org/abs/1504.02420

Recommendations

• Engineering algorithms for workflow satisfiability problem with user-independent constraints
• Pattern backtracking algorithm for the workflow satisfiability problem with user-independent constraints
• On the workflow satisfiability problem with class-independent constraints
• Iterative Plan Construction for the Workflow Satisfiability Problem
• Pattern-based approach to the workflow satisfiability problem with user-independent constraints

zbMATH Keywords

algorithm engineeringfixed-parameter tractability (FPT)reduction to the pseudo-Boolean SAT problemuser-independent constraintsworkflow satisfiability problem (WSP)

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Fundamentals of parameterized complexity
• Parametrized complexity theory.
• Title not available (Why is that?)
• Iterative Plan Construction for the Workflow Satisfiability Problem
• Engineering algorithms for workflow satisfiability problem with user-independent constraints
• Title not available (Why is that?)
• Improved bounds on Bell numbers and on moments of sums of random variables
• Algorithm engineering: Concepts and practice
• Pattern backtracking algorithm for the workflow satisfiability problem with user-independent constraints
• Title not available (Why is that?)
• Errors in graph embedding algorithms

Cited In (9)

• Tight lower bounds for the workflow satisfiability problem based on the strong exponential time hypothesis
• On the workflow satisfiability problem with class-independent constraints
• Parameterized complexity of the workflow satisfiability problem
• Pattern-based approach to the workflow satisfiability problem with user-independent constraints
• Engineering algorithms for workflow satisfiability problem with user-independent constraints
• Fixed-parameter tractability of workflow satisfiability in the presence of seniority constraints
• Pattern backtracking algorithm for the workflow satisfiability problem with user-independent constraints
• On the satisfiability of authorization requirements in business process
• Iterative Plan Construction for the Workflow Satisfiability Problem

Uses Software

• SPOT
• Sat4j

This page was built for publication: Algorithms for the workflow satisfiability problem engineered for counting constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q328681)