A Decomposition Method for Petri Net Based on the Index of Transitions
Qingle Zeng
Abstract
Qingle Zeng
Abstract
By defining the index function of transitions,a new decomposition method for Petri net is presented,with which the decomposed sub net systems are all T-nets.The structural and behavior properties during the decomposition process are analyzed with details,and it is proved that the original system can be obtained by the communion composi- tion of the decomposed subnets.The conclusions and methods will benefit modeling and analyzing the physical systems based on Petri net.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
By defining the index function of transitions,a new decomposition method for Petri net is presented,with which the decomposed sub net systems are all T-nets.The structural and behavior properties during the decomposition process are analyzed with details,and it is proved that the original system can be obtained by the communion composi- tion of the decomposed subnets.The conclusions and methods will benefit modeling and analyzing the physical systems based on Petri net.
Key concepts: Petri net, Computer science, Decomposition, Net (polyhedron), Decomposition method (queueing theory), Function (biology), Process (computing), Functional decomposition