Title
Fault Diagnosis of Discrete-Event Systems Using Continuous Petri Nets
Abstract
When discrete-event systems are used to model systems with a large number of possible (reachable) states, many problems such as simulation, optimization, and control, may become computationally prohibitive because they require some enumeration of such states. A common way to effectively address this issue is fluidization. The goal of this paper is that of studying the effect of fluidization on fault diagnosis. In particular, we focus on the purely logic Petri net (PN) model that results in the untimed continuous PN model after fluidization. In accordance to most of the literature on discrete-event systems, we define three diagnosis states, namely $N$, $U$ , and $F$, corresponding respectively to no fault, uncertain, and fault state. We prove that, given an observation, the resulting diagnosis state can be computed solving linear programming problems rather than integer programming problems as in the discrete case. The main advantage of fluidization is that it enables to deal with much more general PN structures. In particular, the unobservable subnet needs not be acyclic as in the discrete case. Moreover, the compact representation of the set of consistent markings using convex polytopes can be seen in some cases as an improvement in terms of computational complexity.
Year
DOI
Venue
2012
10.1109/TSMCA.2012.2183358
IEEE Transactions on Systems, Man, and Cybernetics, Part A
Keywords
Field
DocType
Petri nets,discrete event systems,fault diagnosis,fluidisation,integer programming,linear programming,compact representation,computational complexity,continuous Petri nets model,convex polytopes,diagnosis state,discrete event systems,fault diagnosis,fluidization,integer programming problem,linear programming problem,unobservable subnet,Discrete event systems,Petri nets,fault diagnosis
Petri net,Fault detection and isolation,Computer science,Subnet,Theoretical computer science,Polytope,Integer programming,Linear programming,Unobservable,Computational complexity theory
Journal
Volume
Issue
ISSN
42
4
1083-4427
Citations 
PageRank 
References 
7
0.46
20
Authors
4
Name
Order
Citations
PageRank
Cristian Mahulea116119.50
Carla Seatzu270067.51
Maria Paola Cabasino331823.10
Manuel Silva440537.39