Subscribe Now Subscribe Today
Science Alert
 
Blue
   
Curve Top
Information Technology Journal
  Year: 2012 | Volume: 11 | Issue: 7 | Page No.: 768-774
DOI: 10.3923/itj.2012.768.774
 
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Invariant Decomposition Conditions for Petri Nets Based on the Index of Transitions

Cong Liu, Qingtian Zeng, Jie Zou, Faming Lu and Qingxin Wu

Abstract:
With the decomposition method of Petri net by assigning an index of the transition set, a structure-complex net system can be decomposed to a set of structure-simple subnets, named T-net. There is a projection relation of the reachable marking set and languages between the original net system and the subnet systems decomposed. However, some unnecessary states and languages are also added in the subnet systems. This study presents the deep research results on the decomposition method of Petri nets based on the index of transitions. A set of necessary and sufficient conditions for keeping the states and languages invariant between the original system and the subnet systems is obtained. Based on the simplified reachable marking graph, an algorithm is given to decide the states and languages invariant.
PDF Fulltext XML References Citation Report Citation
 RELATED ARTICLES:
  •    Recognition Algorithm Design and Complex Analysis for Languages of S-Nets
  •    Logic Petri Nets and Equivalency
  •    Modeling Multimedia Synchronization using Petri Nets
  •    Soundness Analysis of T-Restricted Interorganizational Logical Workflow Nets
How to cite this article:

Cong Liu, Qingtian Zeng, Jie Zou, Faming Lu and Qingxin Wu, 2012. Invariant Decomposition Conditions for Petri Nets Based on the Index of Transitions. Information Technology Journal, 11: 768-774.

DOI: 10.3923/itj.2012.768.774

URL: https://scialert.net/abstract/?doi=itj.2012.768.774

COMMENT ON THIS PAPER
 
 
 

 

 
 
 
 
 
 
 
 
 

 
 
 
 
 

Curve Bottom