| ArtiFlow中artifact生命周期的可满足性问题 |
| |
| 引用本文： | 王颖,刘国华,高尚,赵丹枫,刘海滨.ArtiFlow中artifact生命周期的可满足性问题[J].小型微型计算机系统,2012,33(6):1176-1182. |
| |
| 作者姓名： | 王颖 刘国华 高尚 赵丹枫 刘海滨 |
| |
| 作者单位： | 1. 燕山大学 信息科学与工程学院计算机科学与工程系,河北秦皇岛,066004
2. 燕山大学 信息科学与工程学院计算机科学与工程系,河北秦皇岛066004;东华大学 计算机科学与技术学院,上海201620 |
| |
| 基金项目： | 国家自然科学基金项目，秦皇岛市科学技术研究与发展计划项目 |
| |
| 摘 要： | 以数据为中心是业务过程管理技术发展的一个新趋势.artifact是记录业务过程的数据实体,围绕artifact的业务过程管理正在成为业务过程管理研究的一个热点.生命周期是artifact的一个重要特征,业务过程能否满足对artifact生命周期的定义是业务过程设计中需要验证的一个重要特性.本文从artifact属性赋值顺序的角度,基于Petri网定义artifact的生命周期树.采用ArtiFlow建立业务过程模型,在ArtiFlow模型中根据业务规则提取artifact状态变化树,与artifact生命周期树进行路径比较,验证业务过程模型中artifact生命周期的可满足性.给出相应的算法并分析了算法的复杂度.
|
| 关 键 词： | 业务过程管理 artifact生命周期 Petri网 ArtiFlow 可满足性 |
Satisfiability of Artifact Lifecycle in ArtiFlow |
| |
| WANG Ying
,
LIU Guo-hua
,
GAO Shang
,
ZHAO Dan-feng
,
LIU Hai-bin.Satisfiability of Artifact Lifecycle in ArtiFlow[J].Mini-micro Systems,2012,33(6):1176-1182. |
| |
| Authors: | WANG Ying LIU Guo-hua GAO Shang ZHAO Dan-feng LIU Hai-bin |
| |
| Affiliation: | 1(Department of Computer Science and Engineering,School of Information Science and Engineering,Yanshan University,Qinhuangdao 066004,China) 2(School of Computer Science and Technology,Donghua University,Shanghai 201620,China) |
| |
| Abstract: | One of the new trends in business process management(BPM) is data-centric.Business artifact is a data entity which records the business process.The artifact-oriented BPM becomes a focus in the research of BPM.Lifecycle is a key character of artifact.Whether a business process can satisfy the defined lifecycle is an important property to be checked out.In this paper,artifact lifecycle is defined according to the sequence of assigning values to attributes of artifact.The business process model is constructed by ArtiFlow.In the process of verifying the satisfiability of artifact lifecycle in ArtiFlow,first,the artifact lifecycle is represented by a reachability tree in Petri net.Then an artifact state tree is extracted from ArtiFlow.Last,to decide the satisfiability is transformed to the question of tree path comparison.The algorithms are given and the complexities are analyzed. |
| |
| Keywords: | BPM artifact lifecycle Petri net ArtiFlow satisfiability |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
