Diagnosability Analysis of Labeled Time Petri Net Systems

In this paper, we focus on two notions of diagnosability for labeled Time Petri net (PN) systems: K-diagnosability implies that any fault occurrence can be detected after at most K observations, while r-diagnosability implies that any fault occurrence can be detected after at most r time units. A pr...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on automatic control 2017-03, Vol.62 (3), p.1384-1396
Main Authors: Basile, Francesco, Cabasino, Maria Paola, Seatzu, Carla
Format: Article
Language:English
Subjects:
Automata
Circuit faults
Discrete event systems
Estimation
fault diagnosis
Indexes
Linear programming
Petri nets
Petri nets (PNs)
Timing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we focus on two notions of diagnosability for labeled Time Petri net (PN) systems: K-diagnosability implies that any fault occurrence can be detected after at most K observations, while r-diagnosability implies that any fault occurrence can be detected after at most r time units. A procedure to analyze such properties is provided. The proposed approach uses the Modified State Class Graph, a graph the authors recently introduced for the marking estimation of labeled Time PN systems, which provides an exhaustive description of the system behavior. A preliminary diagnosabilty analysis of the underlying logic system based on classical approaches taken from the literature is required. Then, the solution of some linear programming problems should be performed to take into account the timing constraints associated with transitions.
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2016.2588736