Language, Liveness and Fairness Invariant in Decomposition of Petri Net Based on the Index of Place
Main Article Content
Abstract
It is not easy to analyze the physical system with Petri net if the system is large-scaled and complex, mainly because the structure of the Petri net model is also complex. In order to overcome this difficulty, a decomposition method of Petri net based on an index function of places is introduced, with which a set of well-formed and structure-simple sub net systems can be obtained. For all the sub net systems, the number of all the input or output places of each transition is less than or equal to one. The relationships about the reachable states, languages, liveness and fairness between the original Petri net and its sub net systems are analyzed with details. The sufficient and necessary conditions are presented to keep the reachable states and languages invariant during the decomposition process, which is useful for analysis of liveness and fairness of structure-complex Petri net systems.
Article Details
How to Cite
Zeng, Q. (2006). Language, Liveness and Fairness Invariant in Decomposition of Petri Net Based on the Index of Place. INFOCOMP Journal of Computer Science, 5(1), 11–18. Retrieved from https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/117
Section
Articles
Upon receipt of accepted manuscripts, authors will be invited to complete a copyright license to publish the paper. At least the corresponding author must send the copyright form signed for publication. It is a condition of publication that authors grant an exclusive licence to the the INFOCOMP Journal of Computer Science. This ensures that requests from third parties to reproduce articles are handled efficiently and consistently and will also allow the article to be as widely disseminated as possible. In assigning the copyright license, authors may use their own material in other publications and ensure that the INFOCOMP Journal of Computer Science is acknowledged as the original publication place.