A Polynomial-Time Decomposition Algorithm for a Petri Net Based on Indexes of Places
This study proposes an algorithm for the decomposition
approach of Petri nets based on indexes of places and analyzes the complexity
of the given algorithm. The main data structures required and four key
functions contained in the algorithm are firstly addressed. It is proved
that the proposed decomposition algorithm is a polynomial-time algorithm.
Cited References Fulltext