In: International Journal of Computer Mathematics, Vol. 34, No. 3--4, pages 205-214. 1990.
Abstract: A method of analysis of large Petri nets by partitioning is proposed. This method permits a great saving of computation time and storage, which is specially useful when using mini- or micro-computers. 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: tabular method; analysis (of) large net(s); net partitioning; reachability tree; matrix equations approach.
Back to the Petri Nets Bibliography