Academic Journal
Counting workflow satisfiability with exclusion constraints based on backtracking tree-decomposition
| العنوان: | Counting workflow satisfiability with exclusion constraints based on backtracking tree-decomposition |
|---|---|
| المؤلفون: | Zhinian ZHAI, Weixiang WANG, Yahui LU, Mingwei WU, Zhijun ZHENG, Fahong YU |
| المصدر: | Dianxin kexue, Vol 32, Pp 101-109 (2016) |
| بيانات النشر: | Beijing Xintong Media Co., Ltd, 2016. |
| سنة النشر: | 2016 |
| المجموعة: | LCC:Telecommunication LCC:Technology |
| مصطلحات موضوعية: | workflow, authorization, constraint, resource allocation, satisfiability, Telecommunication, TK5101-6720, Technology |
| الوصف: | Workflow satisfiability（WS）concerns the issue of resource allocation under some access control policies. Counting all its solutions is advantaged to verify the robustness of a workflow to resource exceptions. The counting problem of WS with only exclusion constraints was addressed. The classic backtracking tree-decomposition method was employed to solve #WS（≠）via a polynomial-time counting reduction to a counting constraint satisfiability problem. Experiments show that, the proposed optimized algorithm declined in running time, and has well synthetical performance for workflows with low-density constraints compared to the existing #WS（≠）algorithms. |
| نوع الوثيقة: | article |
| وصف الملف: | electronic resource |
| اللغة: | Chinese |
| تدمد: | 1000-0801 95245820 |
| Relation: | https://doaj.org/toc/1000-0801 |
| DOI: | 10.11959/j.issn.1000-0801.2016260 |
| URL الوصول: | https://doaj.org/article/f01ce41406d144edba95245820bdfedb |
| رقم الانضمام: | edsdoj.f01ce41406d144edba95245820bdfedb |
| قاعدة البيانات: | Directory of Open Access Journals |
| تدمد: | 10000801 95245820 |
|---|---|
| DOI: | 10.11959/j.issn.1000-0801.2016260 |