11
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Analysis of petri nets by partitioning: splitting places or transitions

Pages 127-148 | Received 02 Jan 1991, Published online: 19 Mar 2007
 

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.

C.R. CATEGORIES::

Associate Professor

Associate Professor

Notes

Associate Professor

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.