For the most recent entries see the Petri Nets Newsletter.

An Algorithm For Computing S-Invariants For High Level Petri Nets.

Lin, Ch.; Tong, Z.

In: 91, Universität Koblenz-Landau, FB Informatik: Fachbericht Nr.15. 1991.

Abstract: 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 a HLPN can be generated by a system of integrer linear equations without unfolding the net.


Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography