Iterative Plan Construction for the Workflow Satisfiability Problem
- Submitting institution
-
Royal Holloway and Bedford New College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 28975328
- Type
- D - Journal article
- DOI
-
10.1613/jair.4435
- Title of journal
- Journal of Artificial Intelligence Research
- Article number
- -
- First page
- 555
- Volume
- 51
- Issue
- -
- ISSN
- 1076-9757
- Open access status
- Out of scope for open access requirements
- Month of publication
- November
- Year of publication
- 2014
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
4
- Research group(s)
-
-
- Citation count
- 15
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- We consider the Fixed parameter Tractability (FPT) complexity of Workflow Scheduling. It is seminal work that defines user independent constraints (UI): they include all the constraints listed by ANSI for Role Based Access Control. This work has led to a number of further prize winning conference publications by Gutin et al. Also for some time a SAP extension was introduced which explicitly used UI constraints: dos Santos, D. R., and Ranise, S. On run-time enforcement of authorization constraints in security-sensitive workflows., SEFM 2017. This work also led to funding of Leverhulme grant RPG-2018-161.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -