A polynomial-time decomposition algorithm for a petri net based on indexes of places

Journal of Applied Sciences

Volumn 8, Issue 24, 2008, Pages 4668-4673

  Zeng, Qingtian ^a   Hu, X ^a   Zhu, J ^a   Duan, H ^a  

^a SHANDONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Complexity analysis; Decomposition; Index of place; Petri net; Polynomial time algorithm

Indexed keywords

COMPLEXITY ANALYSIS; DECOMPOSITION ALGORITHM; DECOMPOSITION APPROACH; INDEX OF PLACE; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS;

DECOMPOSITION; PETRI NETS; POLYNOMIALS;

ALGORITHMS;

EID: 63049135767     PISSN: 18125654     EISSN: 18125662     Source Type: Journal    
DOI: 10.3923/jas.2008.4668.4673     Document Type: Article

References (8)

1. Esparza, J., 1994. synthesis of live and bounded free choice petri nets. Inform. Comput., 114: 50-87.
2. Lee, K.H. et al., 1987. Generalized Petri net reduction method. IEEE Trans. Syst. Man Cybernetics, 17: 297-303.
3. Murata, T., 1989. Petri nets, properties, analysis and applications. Proc. IEEE, 77: 541-577.
4. Samir, M.K., 1999. Fast and simple decomposition techniques for the reliability analysis of interconnection networks. J. Syst. Software, 45: 155-171.
5. Wang, H.Q., C.J. Jiang and S.Y. Liao, 2000. Behavior relations in synthesis process of Petri net models. IEEE Trans. Robotics Automation, 16: 834-843.
6. Zeng, Q., 2004. Behavior descriptions of structure-complex Petri nets based on synchronous composition. J. Software, 15: 327-337.
7. Zeng, Q.T., 2007. Two symmetrical decomposition methods for structure-complex Petri net and their applications. 8th ACIS International Conference on Software Engineering, SNPD 2007. Artificial Intelligence, Networking and Parallel/Distributed Computing, pp: 1101-1106.
8. Zeng, Q.T. and H. Duan, 2007. Behavior description for complex flexible manufacturing system based on decomposition of Petri net. Int. J. Comput Syst. Sci. Eng., 22: 359-363.