Efficiently Computing Minimal-Support Nonnegative Integer Invariants of Petri Nets
暂无分享,去创建一个
[1] Toshimasa Watanabe,et al. An algorithm GMST for extracting minimal siphon-traps and its application to efficient computation of Petri net invariants , 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..
[2] Shimon Even,et al. Graph Algorithms , 1979 .
[3] S. Taoka,et al. Extracting Minimal Siphon-Traps of Petri Nets and Its Application to Computing Nonnegative Integer-Invariants , 2002, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..
[4] Wolfgang Reisig. Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.
[5] Manuel Silva Suárez,et al. Convex geometry and semiflows in P/T nets. A comparative study of algorithms for computation of minimal P-semiflows , 1991, Applications and Theory of Petri Nets.
[6] Dilip Sarkar,et al. A new methodology for analyzing distributed systems modeled by petri nets , 1990 .
[7] Tadao Murata,et al. Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.
[8] Toshimasa Watanabe,et al. Siphon-Trap-Based Algorithms for Efficiently Computing Petri Net Invariants , 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..
[9] M. Yamauchi,et al. Finding Minimal Siphons in General Petri Nets , 1996 .
[10] Hiroshi Matsuno,et al. Structural Modeling and Analysis of Signaling Pathways Based on Petri Nets , 2006, J. Bioinform. Comput. Biol..
[11] Katsushi Takano. Experimental Evaluation of Two Algorithms for Computing Petri Net Invariants , 2001 .