By Topic

A fast and space-saving algorithm for computing invariants of Petri nets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yamauchi, M. ; Fac. of Eng., Hiroshima Univ., Japan ; Wakuda, M. ; Taoka, S. ; Watanabe, T.

The paper proposes a new efficient algorithm STFM for finding one or more elementary invariants by combining the Fourier-Motzkin method and the minimal siphon extraction algorithm FDMS. The main point is that it tries to decrease the number of candidate vectors by restricting computation of invariants to place sets S or transition sets R such that .S=S. (siphon and trap) or .R=R. , respectively. Experimental results are provided to show that incorporating this restriction into the Fourier-Motzkin method greatly reduces the maximum number of candidate vectors

Published in:

Systems, Man, and Cybernetics, 1999. IEEE SMC '99 Conference Proceedings. 1999 IEEE International Conference on  (Volume:1 )

Date of Conference: