| 本文已被：浏览 2631次 下载 5619次 |
码上扫一扫！ |
|
|
| 基于完全有限前缀展开的行为等价过程树生成算法 |
|
朱锐1,2,3,4, 黄月1,4, 金芝2,3, 李彤4,5, 汤雅惠1,4
|
|
1.云南大学软件学院, 云南 昆明 650091;2.北京大学信息科学技术学院, 北京 100871;3.高可信软件技术教育部重点实验室(北京大学), 北京 100871;4.云南省软件工程重点实验室(云南大学), 云南 昆明 650091;5.云南农业大学 大数据学院, 云南 昆明 650201
|
|
| 摘要: |
| 过程树能够兼具过程模型的行为和结构，在简化模型结构的复杂度方面具有重要意义.现有过程树转化仅能将基于块结构的简单过程模型转化为过程树，无法将具有复杂结构的过程模型转化过程树.为此，提出了一种基于完全有限前缀展开的行为等价过程树生成算法，用于将与过程树行为等价的过程模型转化为行为等价过程树.该方法首先利用完全有限前缀展开技术分析过程模型，抽取模型的活动关系；其次通过分析活动关系，进而对模型进行重构.最终通过活动关系判断和模型重构的不断迭代操作，构建行为等价过程树.通过在测试模型上的实验，验证了该算法在行为等价过程树生成方面的正确性和可行性. |
| 关键词: 过程模型 复杂结构 Petri网 过程树 完全有限前缀展开 |
| DOI：10.13328/j.cnki.jos.006162 |
| 分类号:TP311 |
| 基金项目:国家自然科学基金（62002310）；云南省重大科技专项计划（202002AD080002）；云南省自然科学基金（2019FB135）；云南省软件工程重点实验室开放基金资助项目（2020SE404）；云南大学数据驱动的软件工程省科技创新团队资助项目（2017HC012）；云南大学“东陆中青年骨干教师”培养计划资助项目（C176220200） |
|
| Generating Algorithm for the Behavior Equivalent Process Tree Based on Complete Finite Prefix Unfolding |
|
ZHU Rui1,2,3,4, HUANG Yue1,4, JIN Zhi2,3, LI Tong4,5, TANG Ya-Hui1,4
|
|
1.School of Software, Yunnan University, Kunming 650091, China;2.School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, China;3.Key Laboratory of High Confidence Software Technologies(Peking University), Ministry of Education, Beijing 100871, China;4.Key Laboratory in Software Engineering of Yunnan Province(Yunnan University), Kunming 650091, China;5.School of Big Data, Yunnan Agricultural University, Kunming 650201, China
|
| Abstract: |
| The process tree has both the behavior and the structure of process model, and it is significant on simplifying the complexity of the process model. Existing methods can only transform the block structured process model into process tree. However, it is difficult to transform process model with complex structure into process tree. To solve this problem, a generating algorithm for the behavior equivalent process tree based on complete finite prefix unfolding is proposed. The algorithm is used to transform the process tree in behavior equivalent's process model into behavior equivalent process tree. This algorithm analyzes the process model based on an incomplete prefix unfolding technique and extracts the relationships between process model activities. After analyzing the activity relation, the algorithm reconstructs the process model. The behavior equivalent process tree is constructed through activity relation judgment and the iterative operation of model reconstruction. The validity and feasibility of the proposed algorithm in the generation of behavioral equivalent process tree are verified by experiments on the test model. |
| Key words: process model complex structure Petri net process tree complete finite prefix unfolding |
