.png){kind=icon}
返回
Algorithms for tractable compliance problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s11704-014-3239-y.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In general the problem of verifying whether a structured business process is compliant with a given set of regulations is NP-hard. The present paper focuses on identifying a tractable subset of this problem, namely verifying whether a structured business process is compliant with a single global obligation. Global obligations are those whose validity spans for the entire execution of a business process. We identify two types of obligations: achievement and maintenance. In the present paper we firstly define an abstract framework capable to model the problem and secondly we define procedures and algorithms to deal with the compliance problem of checking the compliance of a structured business process with respect to a single global obligation. We show that the algorithms proposed in the paper run in polynomial time.
Keyword:
compliance
business process models
algorithms
computational complexity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.6
论文数:
1.6K
被引数:
2.8K
机构
引用论文
Enamine Barbiturates and Thiobarbiturates as a New Class of Bacterial Urease Inhibitors亚胺巴比妥酸和硫代巴比妥酸作为一类新的细菌脲酶抑制剂
OAAI
.png){kind=icon}
OAAI分享收藏 没有更多内容
没有更多内容