IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v32y2016i1d10.1007_s10878-015-9877-7.html
   My bibliography  Save this article

Algorithms for the workflow satisfiability problem engineered for counting constraints

Author

Listed:
  • D. Cohen

    (Royal Holloway, University of London)

  • J. Crampton

    (Royal Holloway, University of London)

  • A. Gagarin

    (Royal Holloway, University of London)

  • G. Gutin

    (Royal Holloway, University of London)

  • M. Jones

    (Royal Holloway, University of London)

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 (PB) 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.

Suggested Citation

  • D. Cohen & J. Crampton & A. Gagarin & G. Gutin & M. Jones, 2016. "Algorithms for the workflow satisfiability problem engineered for counting constraints," Journal of Combinatorial Optimization, Springer, vol. 32(1), pages 3-24, July.
    • Handle: RePEc:spr:jcomop:v:32:y:2016:i:1:d:10.1007_s10878-015-9877-7
    DOI: 10.1007/s10878-015-9877-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-015-9877-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-015-9877-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:32:y:2016:i:1:d:10.1007_s10878-015-9877-7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.