By Topic

Diagnosability for discrete event systems based on Petri net language

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)
Fei Xue ; Dept. of Autom., Tsinghua Univ., Beijing, China ; Da-Zhong Zheng

In this paper, the diagnosability for discrete event systems has been extended to Petri net language, which is motivated from some network systems. A composition net, called as verifier, is constructed for analysis of diagnosability. It is proved that the diagnosability for Petri net language is equal to a reachability problem of verifier with respect to the marked markings set for any failure transition of system. The practical verification condition is further given for general unbounded Petri net based on the coverability tree of verifier.

Published in:

Control, Automation, Robotics and Vision Conference, 2004. ICARCV 2004 8th  (Volume:3 )

Date of Conference:

6-9 Dec. 2004