By Topic

Two efficient methods for computing 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
$33 $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)
K. Takano ; Graduate Sch. of Eng., Hiroshima Univ., Japan ; S. Taoka ; M. Yamauchi ; T. Watanabe

We consider only P-invariants that are nonnegative integer vectors. A P-invariant of a Petri net N=(P, T, E, α, β) is a |P|-dimensional vector Y with Y†·A=0 for the place-transition incidence matrix A of N. The support of an invariant is the set of elements having nonzero values in the vector. Since any invariant is expressed as a linear combination of minimal-support invariants (MS-invariants) with nonnegative rational coefficients, it is common to try to obtain either several invariants or the set of all MS-invariants. The Fourier-Motzkin method (FM) is wellknown for computing a set of invariants including all MS-invariants, but it has critical deficiencies. We propose the following two methods: (1) FM1_m2 that finds a smallest possible set of invariants including all MS-invariants; and (2) STFM_T_ that necessarily produces one or more invariants if they exist. Experimental results are given to show their superiority over existing ones

Published in:

Systems, Man, and Cybernetics, 2001 IEEE International Conference on  (Volume:4 )

Date of Conference:

2001