电子学报2017，Vol.45Issue(3)：605-611,7.DOI:10.3969/j.issn.0372-2112.2017.03.015
工作流可满足性(≠,=)计数及其#P完全性
Counting Workflow Satisfiability(≠, =) and Its #P Completeness
摘要
Abstract
Workflow satisfiability (WS)is an essential claim to access control (AC)policies from the view of resource allocation.So far,the related researches are concentrated on the decision problem of WS,which finds a single solution to show the correctness of an AC policy.However,to further verify its rationality under resource exception,and to count all the solutions will be more useful.In this paper,the counting problem of WS with exclusion and binding constraints is addressed.The problem is proved to be #P complete by constructing a polynomial time counting reduction from the well-known #P complete problem of #3SAT to it,and then gets a theoretical basis to be solved appropriately.关键词
工作流/访问控制/授权/约束/资源分配/可满足性Key words
workflow/access control/authorization/constraint/resource allocation/satisfiability分类
信息技术与安全科学引用本文复制引用
翟治年,卢亚辉,余法红,周武杰,向坚,吴茗蔚..工作流可满足性(≠,=)计数及其#P完全性[J].电子学报,2017,45(3):605-611,7.基金项目
国家自然科学基金(No.61502429,No.61302112) （No.61502429,No.61302112）
浙江省自然科学基金(No.LQ15F020010,No.LY16F020027) （No.LQ15F020010,No.LY16F020027）
浙江省教育厅科研项目(No.Y201533771) （No.Y201533771）
钱江人才计划(No.QJD1402023) （No.QJD1402023）
