工作流网合成规则及其在流程设计中的应用

doi:10.3969/j.issn.1001-2400.2012.02.033

Abstract

Abstract:

In view of the limitation of one node extension in the node refinement method during the workflow net (WF-net) modeling, a WF-net refinement method based on Petri net synthesis rules is proposed. The synthesis rules of live and bounded free choice nets are added with constraints to adapt them to the refinement of free choice WF-nets. Then separable WF-nets are defined and their separability-preserving synthesis rules are given. It is proved that the synthesized WF-nets by these rules from free choice or separable WF-nets are sound. For the two classes of WF-nets, this method enables their refinement to involve more than one node, and provides their modeling with fine-grained guidelines of a different dimension.

Key words: workflow, Petri net, synthesis rule, free choice WF-net, separable WF-net

CLC Number:

TP311

ZHANG Man;DUAN Zhenhua. Synthesis rules of WF-nets and their application in process design[J].J4, 2012, 39(2): 200-206.

References

［1］ van der Aalst W M P. Workflow Verification: Finding Control-flow Errors Using Petri-net-based Techniques ［C］//Business Process Management 2000, LNCS 1806. Heidelberg: Springer, 2000: 161-183.
［2］ Chrzastowski-Wachtel P, Benatallah B, Hamadi R, et al. A Top-down Petri Net-based Approach for Dynamic Workflow Modeling ［C］//Business Process Management 2003, LNCS 2678. Eindhoven: Springer, 2003: 336-353.
［3］ Ding Z J, Zhang Y Y, Jiang C J, et al. Refinement of Petri Nets in Workflow Integration ［C］//10th Computer Supported Cooperative Work in Design. Nanjing: IEEE, 2006: 667-678.
［4］董利达, 程曦浩, 郑寒. 基于工作流的安全库所替换网特性研究［J］. 浙江大学学报(工学版), 2010, 44(9): 1711-1718.
Dong Lida, Cheng Xihao, Zheng Han. Properties Research of Petri Nets Safety Place Substitution Based on Workflow Nets ［J］. Journal of Zhejiang University (Engineering Science), 2010, 44(9): 1711-1718.
［5］ Esparza J. Reduction and Synthesis of Live and Bounded Free Choice Petri Nets ［J］. Information and Computation, 1994, 114(1): 50-87.
［6］ Esparza J, Silva M. On the Analysis and Synthesis of Free Choice Systems ［C］//Advances in Petri Nets 1990, LNCS 483. Bonn: Springer, 1991: 243-186.
［7］ van der Aalst W M P, Lassen K B. Translating Unstructured Workflow Processes to Readable BPEL: Theory and Implementation ［J］. Information and Software Technology, 2008, 50(3): 131-159.
［8］雷丽晖, 段振华. 使用扩展区间时序逻辑为并发工作流建模［J］. 西安电子科技大学学报, 2007, 34(4): 673-680.
Lei Lihui, Duan Zhenhua. Modelling Concurrent Workflow with the Extended Interval Temporal Logic ［J］. Journal of Xidian University, 2007, 34(4): 673-680.
［9］张曼, 段振华, 王小兵. BPEL流程建模中的交叠模式分析与转换［J］. 软件学报, 2011, 22(11): 2684-2697.
Zhang Man, Duan Zhenhua, Wang Xiaobing. Analysis and Transformation of Overlapped Patterns in BPEL Modeling ［J］. Journal of Software, 2011, 22(11): 2684-2697.
［10］郝克刚, 丁剑洁. 层次结构的Petri网［J］. 计算机科学与探索, 2008, 2(2): 123-130.
Hao Kegang, Ding Jianjie. Hierarchical Petri Nets ［J］. Journal of Frontiers of Computer Science and Technology, 2008, 2(2): 123-130.

[1]	WANG Yan. Enhanced multi-objective evolutionary algorithm for workflow scheduling on the cloud platform [J]. Journal of Xidian University, 2019, 46(1): 130-136.
[2]	WANG Qi;CHEN Xiaoliang. Algorithm for estimating confusion states of flexible manufacturing systems [J]. Journal of Xidian University, 2017, 44(2): 69-74.
[3]	MA Ziyue;TONG Yin. Supervisor synthesis in Petri nets based on basis marking graphs [J]. Journal of Xidian University, 2016, 43(6): 68-73.
[4]	JIANG Zhongyuan;ZHANG Xiuyan;MA Ziyue. Capacity optimization for power storage systems in smart grids [J]. J4, 2015, 42(6): 106-112.
[5]	ZHANG Xiuyan;ZHONG Chunfu;JIA Jianyuan. Method to compute the reachability set of S³PR [J]. J4, 2015, 42(5): 105-109.
[6]	ZHANG Li;ZHAO Liangxu;WANG Shouguang;WANG Chengying. Optimal linear constraint transformation method for α-nets [J]. J4, 2015, 42(5): 183-187+212.
[7]	CHEN Xiaoliang;JIANG Zhongyuan;YE Jianhong . Confusion detection and prevention policies for workflow nets [J]. J4, 2015, 42(2): 77-83.
[8]	ZHU Chengcheng;DONG Lida. Concurrency bug test for a class of multithreaded software [J]. J4, 2015, 42(2): 167-173+212.
[9]	YOU Dan;LIU Miao;WU Wenhui;WANG Shouguang. Method to compute the strict minimal siphon for S³PR [J]. J4, 2014, 41(4): 193-197+204.
[10]	HONG Liang. On efficient estimation of reachable markings for S³PR [J]. J4, 2014, 41(3): 169-173.
[11]	LI Ye;WANG Yinghui;YU Zhenhua. Formal modeling of cyber-physical systems using object-oriented Petri nets [J]. J4, 2014, 41(2): 165-171.
[12]	WANG Qi;WANG Anrong;PU Xuqiang. Computation of special markings of Petri nets of manufacturing systems [J]. J4, 2013, 40(6): 85-91.
[13]	CHEN Yu-feng;LI Zhi-wu. Computation of marking/transition separation instances for safe Petri nets using BDD [J]. J4, 2010, 37(1): 119-124+141.
[14]	. Deadlock prevention approach for a class of timed Petri nets [J]. J4, 2009, 36(5): 902-908.
[15]	ZHU Sen;LI Zhi-wu. On the colored Petri net model of the C³I system of the double aircraft carriers group [J]. J4, 2009, 36(4): 661-668.

Synthesis rules of WF-nets and their application in process design

PDF (PC)

Like

Knowledge

Cited

Abstract

Cite this article

share this article

References

Related Articles 15

Metrics

Comments

Recommended 0