DefinePK

DefinePK hosts the largest index of Pakistani journals, research articles, news headlines, and videos. It also offers chapter-level book search.

Select Collection

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

Article Information

Get PDF View Article
Login to Add in Library

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

Authors: Qingtian Zeng

Journal: Information Technology Journal

HEC Recognition History
No recognition records found.

Publisher: Asian Network for Scientific Information (ANSInet)

Country: Pakistan

Year: 2011

Volume: 10

Issue: 4

Language: English

DOI: 10.10.3923/itj.2011.856.862

Keywords: DecompositionPetri netpolynomial-time algorithmindex of transition

Categories
Automata Theory (5) Linguistics (10232) Computer Science (14978) Mathematics (5170) Artificial Intelligence (6625)

Abstract

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.

Paper summary is not available for this article yet.

Loading PDF...

Loading Statistics...