By Topic

A polynomial-time algorithm for finding a semi-generator of Petri net invariants

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

3 Author(s)
Tanida, T. ; Fac. of Eng., Hiroshima Univ., Japan ; Watanabe, T. ; Onaga, K.

A polynomial-time algorithm is proposed for finding a semigenerator of Petri net invariants. Invariants of a Petri net are solutions to a linear system of equations Ax=0 for the place-transition incidence matrix A representing this Petri net. The notion of a semigenerator is introduced: it is a maximal subset consisting of linearly independent elements of a generator, and any invariant can be expressed as linear combination of those elements in the set with negative coefficients allowed. The proposed algorithm adopts a linear programming technique

Published in:

Circuits and Systems, 1991., IEEE International Sympoisum on

Date of Conference:

11-14 Jun 1991