Deadlock checking for one-place unbounded Petri nets based on modified reachability trees

Document Type

Article

Publication Date

6-1-2008

Abstract

A deadlock-checking approach for one-place unbounded Petri nets is presented based on modified reachability trees (MRTs). An MRT can provide some useful information that is lost in a finite reachability tree, owing to MRT's use of the expression a + bnirather than symbol ω to represent the value of the components of a marking. The information is helpful to property analysis of unbounded Petri nets. For the deadlock-checking purpose, this correspondence paper classifies full conditional nodes in MRT into two types: True and fake ones. Then, an algorithm is proposed to determine whether a full conditional node is true or not. Finally, a necessary and sufficient condition of deadlocks is presented. Examples are given to illustrate the method. © 2008 IEEE.

Identifier

44849128921 (Scopus)

Publication Title

IEEE Transactions on Systems Man and Cybernetics Part B Cybernetics

External Full Text Location

https://doi.org/10.1109/TSMCB.2008.917177

ISSN

10834419

PubMed ID

18558549

First Page

881

Last Page

883

Issue

3

Volume

38

Grant

60534060

Fund Ref

Ministry of Education

This document is currently not available here.

Share

COinS