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

Feng Zheng, Shudong Sun, Shubin Si

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)166-170
Number of pages5
JournalXibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University
Volume22
Issue number2
StatePublished - Apr 2004

Keywords

  • Deadlock
  • Detection
  • OOPN (Object-Oriented Petri Net)

Fingerprint

Dive into the research topics of 'On decreasing complexity of deadlock detection of object-oriented Petri net'. Together they form a unique fingerprint.

Cite this