微信服务号

微信订阅号

2025-4-9- 10
Home > Archive>Volume 32, Issue 5, 2021 >1385-1403. DOI:10.13328/j.cnki.jos.006162
PDF HTML XML Export Cite reminder
Generating Algorithm for the Behavior Equivalent Process Tree Based on Complete Finite Prefix Unfolding
Author:
Affiliation:

Clc Number:

TP311

Fund Project:

National Natural Science Foundation of China (62002310); Major Project of Science and Technology of Yunnan Province (202002AD080002); Yunnan Provincial Natural Science Foundation of China (2019FB135); Yunnan Provincial Open Fund Project of the Software Engineering Key Laboratory (2020SE404); Yunnan University Data-driven Software Engineering Provincial Science and Technology Innovation Team Foundation of China (2017HC012); Yunnan University "Dong Lu Young-backbone Teacher" Training Program of China (C176220200)

  • Article
    • | |
  • Metrics
    • |
  • Reference
    • |
  • Related
    • |
  • Cited by
    • | |
  • Comments
    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.

    Reference
    Related
    Cited by
Get Citation

朱锐,黄月,金芝,李彤,汤雅惠.基于完全有限前缀展开的行为等价过程树生成算法.软件学报,2021,32(5):1385-1403

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:April 22,2020
  • Revised:August 24,2020
  • Online: December 02,2020
  • Published: May 06,2021
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063