By Topic

Diagnosability of Petri nets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
YuanLin Wen ; Dept. of Electr. Eng., Nat. Taiwan Ocean Univ., Keelung, Taiwan ; MuDer Jeng

Diagnosability of discrete event systems (DES) was formally defined in finite state machine (FSM) models by Sampath, et al. They gave a method for testing diagnosability by first constructing a diagnoser for the system. The complexity of this method is exponential in the number of states and doubly exponential in the number of failure types. Later, Yoo, et al. developed an algorithm to solve the diagnosability problem with polynomial complexity in the number of states. We explore diagnosability of discrete event systems modeled by Petri nets. This gives us an advantage to solve large real-world problems. First, diagnosability of Petri nets is defined in terms of net structures, then, we proposed an algorithm that could be used for checking diagnosability property of discrete event systems. Examples are given to illustrate the approach.

Published in:

Systems, Man and Cybernetics, 2004 IEEE International Conference on  (Volume:5 )

Date of Conference:

10-13 Oct. 2004