A tabular method for the analysis of large petri nets

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, which is specially useful when using mini or microcomputers. 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:

• Analysis techniques
• matrix equations
• Petri nets
• problem size
• reachability tree

On leabe at: Department of Computer Science —3190 MEB University of Urah. SLC. UT 84112

On leabe at: Department of Computer Science —3190 MEB University of Urah. SLC. UT 84112

Notes

On leabe at: Department of Computer Science —3190 MEB University of Urah. SLC. UT 84112