An Algorithm for Computing S-Invariants for High Level Petri Nets
Chuang Lin, Dan Cristian Marinescu · Purdue e-Pubs (Purdue University System) · 1989
Net invariants and reachability trees are used to investigate dynamic properties of Petri Nets. Both concepts have been generalized for different classes of High Level Petri Nets. In this paper we introduce the compound token and the token flow path concepts. Then we present an algorithm to compute the S-invariants of a High Level Petri Net using the compound token and the token flow path ideas and show that all S-invariants of an HLPN can be generated by a system of integer linear equations without unfolding the net.