Optimized Algorithm for Computing Invariants of Ordinary Petri Nets

We propose an optimized implementation of the Fourier-Motzkin (FM) algorithm for computing all nonnegative, minimal-support invariants of ordinary Petri nets. The FM algorithm is optimized by detecting the parallel place sets created during each of its iteration, and retaining just one member of each set while deleting the rest. The intermediate invariants obtained are then used to generate all minimal-support invariants using an optimized invariant generation process. Experimental results indicate that the proposed algorithm is at least 2.2X faster in execution and requires at least 1.8x less memory than other comparable algorithms

[1]  Katsushi Takano.  Experimental Evaluation of Two Algorithms for Computing Petri Net Invariants , 2001 .

[2]  T. Cecchin,et al.  A decentralized approach for computing invariants in large scale and interconnected Petri nets , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[3]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[4]  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..

[5]  J. Farkas.  Theorie der einfachen Ungleichungen. , 1902 .

[6]  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..

[7]  M. Yamauchi,et al.  A fast and space-saving algorithm for computing invariants of Petri nets , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[8]  K. Onaga,et al.  A polynomial-time algorithm for finding a semi-generator of Petri net invariants , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[9]  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.

[10]  Toshimasa Watanabe,et al.  Two efficient methods for computing Petri net invariants , 2001, 2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236).

[11]  T. Cecchin,et al.  On generating a basis of invariants in Petri nets , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[12]  Sebastiano Trigila,et al.  Concurrent system analysis using Petri nets: an optimized algorithm for finding net invariants , 1988, Comput. Commun..

[13]  Manuel Silva,et al.  A Simple and Fast Algorithm to Obtain All Invariants of a Generalized Petri Net , 1980, Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets.