Research on Completeness in Decomposition and Composition of Petri Nets

被引：0

作者：

Hou, Chunlong ^{[1
]}

Ma, Zeng ^{[1
]}

Qi, Xinzhan ^{[1
]}

机构：

[1] Navy Submarine Acad, Qingdao 266041, Peoples R China

来源：

DIGITAL MANUFACTURING & AUTOMATION III, PTS 1 AND 2 | 2012年 / 190-191卷

关键词：

Decomposition; Composition; Completeness;

D O I：

10.4028/www.scientific.net/AMM.190-191.297

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：297 / 303

页数：7

共 8 条

[1] Chen Xi, 2012, Computer Engineering and Applications, V48, P47, DOI 10.3778/j.issn.1002-8331.2012.05.014
[2] HAO Ke-gang, 2008, J FRONTIERS COMPUTER, V2, P123
[3] Kuang Ying-chun, 2008, Proceedings of the CSU-EPSA, V20, P57
[4] [刘力 LIU Li], 2008, [系统仿真学报, Journal of System Simulation], V20, P6691
[5] Wang Peiliang, 2001, Control Theory & Applications, V18, P116
[6] Wu Z. H., 2006, INTRO PETRI NET
[7] Xu Anguo, 1997, Journal of Software, V8, P493
[8] A reduction technique of Petri nets based on logic circuit
Ye, Jian-Hong
Song, Wen
Sun, Shi-Xin
[J]. Ruan Jian Xue Bao/Journal of Software, 2007, 18 (07): : 1553 - 1562

← 1 →