In: Theoretical Computer Science, Vol. 77, pages 321-330. 1990.
Abstract: In this paper, a method of analysis of large Petri nets by partitioning is proposed. This method permits a great saving of computation time and storage. Useless efforts spent in the analysis of large Petri nets are spared by a look to partitions of interest. It is possible to study the characteristics of the required places by involving them in a partiton. It was shown that partitioning preserves the characteristics of the main Petri net. The reachability tree method or the matrix equations approach, which were untractable at the whole net level, may be used at the subnet level to get the needed analysis criteria.
Keywords: net analysis (by) partitioning; splitting transition; reachability tree method; matrix equations; subnet.
Back to the Petri Nets Bibliography