On the Satisfiability of Workflows with Release Points. / Crampton, Jason; Gutin, Gregory; Watrigant, Remi.

SACMAT '17 Abstracts: Proceedings of the 22nd ACM on Symposium on Access Control Models and Technologies. ACM, 2017. p. 207-217.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Published

Standard

On the Satisfiability of Workflows with Release Points. / Crampton, Jason; Gutin, Gregory; Watrigant, Remi.

SACMAT '17 Abstracts: Proceedings of the 22nd ACM on Symposium on Access Control Models and Technologies. ACM, 2017. p. 207-217.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Harvard

Crampton, J, Gutin, G & Watrigant, R 2017, On the Satisfiability of Workflows with Release Points. in SACMAT '17 Abstracts: Proceedings of the 22nd ACM on Symposium on Access Control Models and Technologies. ACM, pp. 207-217. https://doi.org/10.1145/3078861.3078866

APA

Crampton, J., Gutin, G., & Watrigant, R. (2017). On the Satisfiability of Workflows with Release Points. In SACMAT '17 Abstracts: Proceedings of the 22nd ACM on Symposium on Access Control Models and Technologies (pp. 207-217). ACM. https://doi.org/10.1145/3078861.3078866

Vancouver

Crampton J, Gutin G, Watrigant R. On the Satisfiability of Workflows with Release Points. In SACMAT '17 Abstracts: Proceedings of the 22nd ACM on Symposium on Access Control Models and Technologies. ACM. 2017. p. 207-217 https://doi.org/10.1145/3078861.3078866

Author

Crampton, Jason ; Gutin, Gregory ; Watrigant, Remi. / On the Satisfiability of Workflows with Release Points. SACMAT '17 Abstracts: Proceedings of the 22nd ACM on Symposium on Access Control Models and Technologies. ACM, 2017. pp. 207-217

BibTeX

@inproceedings{2746c39a39c44029ab277db22cbf6cf5,
title = "On the Satisfiability of Workflows with Release Points",
abstract = "There has been a considerable amount of interest in recent years in the problem of workflow satisfiability, which asks whether the existence of constraints in a workflow specification means that it is impossible to allocate authorized users to each step in the workflow. Recent developments have seen the workflow satisfiability problem (WSP) studied in the context of workflow specifications in which the set of steps may vary from one instance of the workflow to another. This, in turn, means that some constraints may only apply to certain workflow instances. Inevitably, WSP becomes more complex for such workflow specifications. In this paper, we present the first fixed parameter algorithms to solve WSP for workflow specifications of this type. Moreover, we significantly extend the range of constraints that can be used in workflow specifications of this type.",
author = "Jason Crampton and Gregory Gutin and Remi Watrigant",
year = "2017",
month = jun,
doi = "10.1145/3078861.3078866",
language = "English",
isbn = "978-1-4503-4702-0",
pages = "207--217",
booktitle = "SACMAT '17 Abstracts",
publisher = "ACM",

}

RIS

TY - GEN

T1 - On the Satisfiability of Workflows with Release Points

AU - Crampton, Jason

AU - Gutin, Gregory

AU - Watrigant, Remi

PY - 2017/6

Y1 - 2017/6

N2 - There has been a considerable amount of interest in recent years in the problem of workflow satisfiability, which asks whether the existence of constraints in a workflow specification means that it is impossible to allocate authorized users to each step in the workflow. Recent developments have seen the workflow satisfiability problem (WSP) studied in the context of workflow specifications in which the set of steps may vary from one instance of the workflow to another. This, in turn, means that some constraints may only apply to certain workflow instances. Inevitably, WSP becomes more complex for such workflow specifications. In this paper, we present the first fixed parameter algorithms to solve WSP for workflow specifications of this type. Moreover, we significantly extend the range of constraints that can be used in workflow specifications of this type.

AB - There has been a considerable amount of interest in recent years in the problem of workflow satisfiability, which asks whether the existence of constraints in a workflow specification means that it is impossible to allocate authorized users to each step in the workflow. Recent developments have seen the workflow satisfiability problem (WSP) studied in the context of workflow specifications in which the set of steps may vary from one instance of the workflow to another. This, in turn, means that some constraints may only apply to certain workflow instances. Inevitably, WSP becomes more complex for such workflow specifications. In this paper, we present the first fixed parameter algorithms to solve WSP for workflow specifications of this type. Moreover, we significantly extend the range of constraints that can be used in workflow specifications of this type.

U2 - 10.1145/3078861.3078866

DO - 10.1145/3078861.3078866

M3 - Conference contribution

SN - 978-1-4503-4702-0

SP - 207

EP - 217

BT - SACMAT '17 Abstracts

PB - ACM

ER -