Analysis of petri nets by partitioning: splitting places or transitions

Abstract

In this paper, two methods for the analysis of large Petri nets by partitioning are proposed. These methods permit a great saving of computation time and storage. Useless efforts spent in the analysis of large Petri nets are spared by a look to the partitions of interest. It is possible to study the characteristics of the required places by involving them in a partition. 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.