On decreasing complexity of deadlock detection of object-oriented Petri net

Feng Zheng, Shudong Sun, Shubin Si

科研成果: 期刊稿件文章同行评审

1 引用 (Scopus)

摘要

OOPN is widely used, but the detection of its deadlock is a problem to be solved. This paper aims to decrease the complexity of the detection of its deadlock as an important step towards the solution of the deadlock detection problem of OOPN. Mathematical analysis is used as it's attacking tool. Definitions of OOPN are given. The deadlocks are divided into structural deadlock, restrictive deadlock and mark deadlock. The way to detect these three types of deadlocks in a given OOPN is given. If a designer detects his specific OOPN to contain structural deadlocks, he should make changes until no structural deadlock can be detected. Thus the detection method appears to be satisfactory for decreasing the complexity of deadlock detection of OOPN.

源语言英语
页(从-至)166-170
页数5
期刊Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University
22
2
出版状态已出版 - 4月 2004

指纹

探究 'On decreasing complexity of deadlock detection of object-oriented Petri net' 的科研主题。它们共同构成独一无二的指纹。

引用此