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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
