Solving the Workflow Satisfiability Problem using General Purpose Solvers

05/07/2021
by   Daniel Karapetyan, et al.
10

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 k of steps is typically small compared to the number of users in the real-world instances of WSP; therefore k 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/15/2019

Bounded and Approximate Strong Satisfiability in Workflows

There has been a considerable amount of interest in recent years in the ...
research
06/10/2021

Valued Authorization Policy Existence Problem: Theory and Experiments

Recent work has shown that many problems of satisfiability and resilienc...
research
01/24/2023

Solving Quantum-Inspired Perfect Matching Problems via Tutte's Theorem-Based Hybrid Boolean Constraints

Determining the satisfiability of Boolean constraint-satisfaction proble...
research
01/16/2014

Developing Approaches for Solving a Telecommunications Feature Subscription Problem

Call control features (e.g., call-divert, voice-mail) are primitive opti...
research
03/23/2023

Soy: An Efficient MILP Solver for Piecewise-Affine Systems

Piecewise-affine (PWA) systems are widely used for modeling and control ...
research
09/26/2018

Results in Workflow Resiliency: Complexity, New Formulation, and ASP Encoding

First proposed by Wang and Li in 2007, workflow resiliency is a policy a...

Please sign up or login with your details

Forgot password? Click here to reset