156 research outputs found
Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis
The Workflow Satisfiability Problem (WSP) asks whether there exists an
assignment of authorized users to the steps in a workflow specification,
subject to certain constraints on the assignment. The problem is NP-hard even
when restricted to just not equals constraints. Since the number of steps
is relatively small in practice, Wang and Li (2010) introduced a
parametrisation of WSP by . Wang and Li (2010) showed that, in general, the
WSP is W[1]-hard, i.e., it is unlikely that there exists a fixed-parameter
tractable (FPT) algorithm for solving the WSP. Crampton et al. (2013) and Cohen
et al. (2014) designed FPT algorithms of running time and
for the WSP with so-called regular and user-independent
constraints, respectively. In this note, we show that there are no algorithms
of running time and for the two
restrictions of WSP, respectively, with any , unless the Strong
Exponential Time Hypothesis fails
The bi-objective workflow satisfiability problem and workflow resiliency
A computerized workflow management system may enforce a security policy, specified in terms of authorized actions and constraints, thereby restricting which users can perform particular steps in a workflow. The existence of a security policy may mean that a workflow is unsatisfiable, in the sense that it is impossible to find a valid plan (an assignment of steps to authorized users such that all constraints are satisfied). Work in the literature focuses on the workflow satisfiability problem, a decision problem that outputs a valid plan if the instance is satisfiable (and a negative result otherwise). In this paper, we introduce the Bi-Objective Workflow Satisfiability Problem (BO-WSP), which enables us to solve optimization problems related to workflows and security policies. In particular, we are able to compute a âleast badâ plan when some components of the security policy may be violated. In general, BO-WSP is intractable from both the classical and parameterized complexity point of view (where the parameter is the number of steps). We prove that computing a Pareto front for BO-WSP is fixed-parameter tractable (FPT) if we restrict our attention to user-independent constraints. This result has important practical consequences, since most constraints of practical interest in the literature are user-independent. Our proof is constructive and defines an algorithm, the implementation of which we describe and evaluate. We also present a second algorithm to compute a Pareto front which solves multiples instances of a related problem using mixed integer programming (MIP). We compare the performance of both our algorithms on synthetic instances, and show that the FPT algorithm outperforms the MIP-based one by several orders of magnitude on most instances. Finally, we study the important question of workflow resiliency and prove new results establishing that known decision problems are fixed-parameter tractable when restricted to user-independent constraints. We then propose a new way of modeling the availability of users and demonstrate that many questions related to resiliency in the context of this new model may be reduced to instances of BO-WSP
Pattern backtracking algorithm for the workflow satisfiability problem with user-independent constraints
The workflow satisfiability problem (WSP) asks whether there exists an assignment of authorised users to the steps in a workflow specification, subject to certain constraints on the assignment. (Such an assignment is called valid.) The problem is NP-hard even when restricted to the large class of user-independent constraints. Since the number of steps k is relatively small in practice, it is natural to consider a parametrisation of the WSP by k. We propose a new fixed-parameter algorithm to solve the WSP with user-independent constraints. The assignments in our method are partitioned into equivalence classes such that the number of classes is exponential in k only. We show that one can decide, in polynomial time, whether there is a valid assignment in an equivalence class. By exploiting this property, our algorithm reduces the search space to the space of equivalence classes, which it browses within a backtracking framework, hence emerging as an efficient yet relatively simple-to-implement or generalise solution method. We empirically evaluate our algorithm against the state-of-the-art methods and show that it clearly wins the competition on the whole range of our test problems and significantly extends the domain of practically solvable instances of the WSP
Solving the Workflow Satisfiability Problem using General Purpose Solvers
The workflow satisfiability problem (WSP) is a well-studied problem in access
control seeking allocation of authorised users to every step of the workflow,
subject to workflow specification constraints. It was noticed that the number
of steps is typically small compared to the number of users in the
real-world instances of WSP; therefore is considered as the parameter in
WSP parametrised complexity research. While WSP in general was shown to be
W[1]-hard, WSP restricted to a special case of user-independent (UI)
constraints is fixed-parameter tractable (FPT). However, restriction to the UI
constraints might be impractical.
To efficiently handle non-UI constraints, we introduce the notion of
branching factor of a constraint. As long as the branching factors of the
constraints are relatively small and the number of non-UI constraints is
reasonable, WSP can be solved in FPT time.
Extending the results from Karapetyan et al. (2019), we demonstrate that
general-purpose solvers are capable of achieving FPT-like performance on WSP
with arbitrary constraints when used with appropriate formulations. This
enables one to tackle most of practical WSP instances. While important on its
own, we hope that this result will also motivate researchers to look for
FPT-aware formulations of other FPT problems.Comment: Associated data: http://doi.org/10.17639/nott.711
Quantified Boolean Formulas: Proof Complexity and Models of Solving
Quantified Boolean formulas (QBF), which form the canonical PSPACE-complete decision problem, are a decidable fragment of first-order logic. Any problem that can be solved within a polynomial-size space can be encoded succinctly as a QBF, including many concrete problems in computer science from domains such as verification, synthesis and planning. Automated solvers for QBF are now reaching the point of industrial applicability.
In this thesis, we focus on dependency awareness, a dedicated solving paradigm for QBF. We show that dependency schemes can be envisaged in terms of dependency quantified Boolean formulas (DQBF), exposing strong connections between these two previously disparate entities. By introducing new lower-bound techniques for QBF proof systems, we study the relative strengths of models of dependency-aware solving, including the proposal of new, stronger models.
Proof Complexity: Using the strategy extraction paradigm, we introduce new lower-bound techniques that apply to resolution-based QBF proof systems. In particular, we use the technique to prove exponential lower bounds for a new family of QBFs called the equality formulas. Our technique also affords considerably simpler, more intuitive proofs of some existing QBF proof-size lower bounds.
Models of Solving: We apply our lower bound techniques to show new separations for QBF proof systems parametrised by dependency schemes. We also propose new models of dynamic dependency-aware solving and prove that they are exponentially stronger than the existing static models. Finally, we introduce Merge Resolution, a proof system modelling CDCL-style solving for DQBF, which is the first of its kind
Parameterized Inapproximability Hypothesis under ETH
The Parameterized Inapproximability Hypothesis (PIH) asserts that no fixed
parameter tractable (FPT) algorithm can distinguish a satisfiable CSP instance,
parameterized by the number of variables, from one where every assignment fails
to satisfy an fraction of constraints for some absolute constant
. PIH plays the role of the PCP theorem in parameterized
complexity. However, PIH has only been established under Gap-ETH, a very strong
assumption with an inherent gap.
In this work, we prove PIH under the Exponential Time Hypothesis (ETH). This
is the first proof of PIH from a gap-free assumption. Our proof is
self-contained and elementary. We identify an ETH-hard CSP whose variables take
vector values, and constraints are either linear or of a special parallel
structure. Both kinds of constraints can be checked with constant soundness via
a "parallel PCP of proximity" based on the Walsh-Hadamard code
On the Workflow Satisfiability Problem with Class-Independent Constraints for Hierarchical Organizations
A workflow specification defines a set of steps, a set of users, and an access control policy. The policy determines which steps a user is authorized to perform and imposes constraints on which sets of users can perform which sets of steps. The workflow satisfiability problem (WSP) is the problem of determining whether there exists an assignment of users to workflow steps that satisfies the policy. Given the computational hardness of WSP and its importance in the context of workflow management systems, it is important to develop algorithms that are as efficient as possible to solve WSP.
In this article, we study the fixed-parameter tractability of WSP in the presence of class-independent constraints, which enable us to (1) model security requirements based on the groups to which users belong and (2) generalize the notion of a user-independent constraint. Class-independent constraints are defined in terms of equivalence relations over the set of users. We consider sets of nested equivalence relations because this enables us to model security requirements in hierarchical organizations. We prove that WSP is fixed-parameter tractable (FPT) for class-independent constraints defined over nested equivalence relations and develop an FPT algorithm to solve WSP instances incorporating such constraints. We perform experiments to evaluate the performance of our algorithm and compare it with that of SAT4J, an off-the-shelf pseudo-Boolean SAT solver. The results of these experiments demonstrate that our algorithm significantly outperforms SAT4J for many instances of WSP
- âŠ