Two Sufficient Conditions on Refactorizability of Acyclic Extended Free Choice Workflow Nets to Acyclic Well-Structured Workflow Nets and Their Application
暂无分享，去创建一个
[1] Yuki Murakami,et al. Sufficient Condition on Refactorizability of Acyclic Extended Free Choice Workflow Nets to Acyclic Well-Structured Workflow Nets , 2013, 2013 First International Symposium on Computing and Networking.
[2] Jörg Desel,et al. Free choice Petri nets , 1995 .
[3] Wil M. P. van der Aalst,et al. The Application of Petri Nets to Workflow Management , 1998, J. Circuits Syst. Comput..
[4] Kees M. van Hee,et al. Workflow Management: Models, Methods, and Systems , 2002, Cooperative information systems.
[5] Shingo Yamaguchi. Polynomial Time Verification of Reachability in Sound Extended Free-Choice Workflow Nets , 2014, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..
[6] Twan Basten,et al. Deciding Life-Cycle Inheritance on Petri Nets , 2003, ICATPN.
[7] Shingo Yamaguchi. Refactoring Problem of Acyclic Extended Free-Choice Workflow Nets to Acyclic Well-Structured Workflow Nets , 2012, IEICE Trans. Inf. Syst..
[8] Manuel Silva Suárez,et al. Circuits, handles, bridges and nets , 1991, Applications and Theory of Petri Nets.
[9] Tadao Murata,et al. Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.
[10] Eike Best,et al. Some Equivalence Results for Free Choice Nets and Simple Nets and on the Periodicity of Live Free Choice Nets , 1983, CAAP.