Research on Completeness in Decomposition and Composition of Petri Nets

Article Preview

Abstract:

Composition and decomposition can be used in refining and combination of Petri nets. Based on the relation of in preconditions and consequences of Petri node, analysis the completeness of the composition and decomposition operation and put forward methods to improve the completeness, in this way can design correct and consistent Petri nets to describe the system.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

297-303

Citation:

Online since:

July 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Hao Kegang, Ding Jianjie. Hierarchical Petri nets [J]Journal of Frontiers of Computer Science & Technology 2008,2(02): 123-130.

Google Scholar

[2] Wu Zhehui, The introduction of Petri net [M] Mechanical Industry Press (2006).

Google Scholar

[3] Wang Peiliang. Union Decomposition of Petri Net[J], Control Theory & Applications, 2001,18(1): 116-118.

Google Scholar

[4] Chen Xi. Research about new technology for Petri net s simplification Computer Engineering and Applications, 2012,48(5): 47-50.

Google Scholar

[5] Kuang Yingchun, Shen Yue, Luo Richeng. Fault Diagnosis of Power System Based on the Union Decomposition Technology of Petri Net [J], Proceedings of the Chinese Society of Universities for Electric Power System and its Automation, 2008,20(1): 57-60.

Google Scholar

[6] Ye Jianhong, Song Wen, Sun Shixin. A Reduction Technique of Petri Nets Based on Logic Circuit[J] Journal of Software, 2007,18(7): 1553-1561.

Google Scholar

[7] Xu Anguo, Jiang Changjun. The Reduction Operations and Their Properties for P/T Nets[J]. Journal of Software, 1997,8(7): 493-504.

Google Scholar

[8] Liu Li, Wei Junhu, Tian Jia. Conflicts in Petri Net Distributed Simulation and Solution[J], Journal of System Simulation, 2008,20(24): 6691-6695.

Google Scholar