Handles and Reachability Analysis of Free Choice Nets
暂无分享,去创建一个
[1] Kunihiko Hiraishi,et al. A Class of Petri Nets That a Necessary and Sufficient Condition for Reachability is Obtainable , 1988 .
[2] Manuel Silva Suárez,et al. Top-down synthesis of live and bounded free choice nets , 1990, Applications and Theory of Petri Nets.
[3] 李 東翊. Analysis and synthesis of Petri nets by state machine decomposition , 1993 .
[4] Manuel Silva Suárez,et al. Circuits, handles, bridges and nets , 1991, Applications and Theory of Petri Nets.
[5] Tadao Murata,et al. Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.
[6] Ernst W. Mayr. An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..
[7] Dong-Ik Lee,et al. Complete structural characterization of state machine allocatable nets , 1991 .
[8] D. I. Lee. Reachability theorem for a class of live and safe free choice nets , 1991 .
[9] Sadatoshi Kumagai,et al. Reachability of LSFC nets , 1990 .
[10] Michel Hack,et al. ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS , 1972 .