Title
Two efficient methods for computing Petri net invariants
Abstract
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
Year
DOI
Venue
2001
10.1109/ICSMC.2001.972977
SMC
Keywords
Field
DocType
petri nets,invariance,fourier-motzkin method,incidence matrix,invariants,minimal siphon-traps,petri net,vectors,yttrium
Integer,Discrete mathematics,Linear combination,Combinatorics,Petri net,Invariant (physics),Stochastic Petri net,Invariant (mathematics),Mathematics,Incidence matrix
Conference
Volume
ISSN
ISBN
4
1062-922X
0-7803-7087-2
Citations 
PageRank 
References 
1
0.38
3
Authors
4
Name
Order
Citations
PageRank
Takano, K.110.38
Taoka, S.210.38
Yamauchi, M.330.86
T. Watanabe425251.28