The Workflow Satisfiability Problem with User-Independent Constraints
The Workflow Satisfiability Problem (WSP) is a problem of interest in access control of information security. In its simplest form is the problem coincides with the Constraint Satisfiability Problem, where the number of variables is usually much smaller than the number of values. Wang and Li (2010) were the first to study the WSP as a problem parameterized by the number of variables. The paper initiated very fruitful research surveyed by Cohen, Crampton, Gutin and Wahlström (2017). In this paper, we briefly overview some more recent WSP algorithmic developments.