On the satisfiability of authorization requirements in business process

DOI10.1007/s11704-016-6016-2zbMath1405.90072OpenAlexW2555051588MaRDI QIDQ1712553

Zhigang Zhang, Yang Bo, Xinzheng Lu, Chunhe Xia

Publication date: 22 January 2019

Published in: Frontiers of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11704-016-6016-2

zbMATH Keywords

satisfiabilitybusiness processseparation of dutyauthorization requirementsbinding of duty

Mathematics Subject Classification ID

Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Theory of organizations, manpower planning in operations research (90B70)

Cites Work

• Algorithms for the workflow satisfiability problem engineered for counting constraints
• Iterative Plan Construction for the Workflow Satisfiability Problem
• Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints
• Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints
• Beyond separation of duty

This page was built for publication: On the satisfiability of authorization requirements in business process