Submit Manuscript

Information Technology Journal

Year: 2011 | Volume: 10 | Issue: 4 | Page No.: 856-862
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Article Trend

Total views 410

Search

Authors

Qingtian Zeng

Keywords

Research Article

A Polynomial-time Decomposition Algorithm for Petri Nets Based on Indexes of Transitions

Qingtian Zeng
Similar to the decomposition approach for Petri nets based on the indexes of places, decomposition based on the indexes of transitions is also convenient to analyze dynamic properties of structure-complex Petri nets. This study proposes an algorithm for the decomposition approach based on indexes of transitions and analyzes the complexity of the given algorithm. The main data structures required and four key functions contained in the decomposition algorithm are addressed firstly. It is proved that the proposed decomposition algorithm is a polynomial-time algorithm.
PDF Fulltext XML References Citation

Leave a Comment

Your email address will not be published. Required fields are marked *