Verification of Fault-predictability in Labeled Petri Nets Using Predictor Graphs

A fault-predictable discrete event system (DES) is a system where any fault can be correctly predicted before its occurrence. This paper studies the verification of fault-predictability in bounded and unbounded DESs modeled by labeled Petri nets (PNs). An approach based on the construction of a Pred...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on automatic control Vol. 64; no. 10; pp. 4353 - 4360
Main Authors You, Dan, Wang, ShouGuang, Seatzu, Carla
Format Journal Article
LanguageEnglish
Published New York IEEE 01.10.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:A fault-predictable discrete event system (DES) is a system where any fault can be correctly predicted before its occurrence. This paper studies the verification of fault-predictability in bounded and unbounded DESs modeled by labeled Petri nets (PNs). An approach based on the construction of a Predictor Net and a Predictor Graph (PG) is proposed. In particular, a necessary and sufficient condition for fault-predictability is derived by characterizing the structure of the PG. Furthermore, two rules are proposed to reduce the size of a given PN, which allows one to analyze the fault-predictability of the original net by verifying the fault-predictability of the reduced net.
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2019.2897272