Paper Info
Title
On-The-Fly Diagnosability Analysis Of Bounded And Unbounded Labeled Petri Nets Using Verifier Nets
Abstract
This paper considers the problem of diagnosability analysis of discrete event systems modeled by labeled Petri nets (LPNs). We assume that the LPN can be bounded or unbounded with no deadlock after firing any fault transition. Our approach is novel and presents the on-the-fly diagnosability analysis using verifier nets. For a given LPN model, the verifier net and its reachability graph (for a bounded LPN) or coverability graph (for an unbounded LPN) are built on-the-fly and in parallel for diagnosability analysis. As soon as a diagnosability decision is established, the construction is stopped. This approach achieves a compromise between computation limitations due to efficiency and combinatorial explosion and it is useful to implement an engineering approach to the diagnosability analysis of complex systems.
Year
DOI
Venue
2018
10.2478/amcs-2018-0019
INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE
Keywords
Field
DocType
fault diagnosis, discrete event systems, labeled Petri nets, on-the-fly diagnosability analysis, verifier nets
Mathematical optimization,Discrete event system,Petri net,On the fly,Theoretical computer science,Mathematics,Bounded function
Journal
Volume
Issue
ISSN
28
2
1641-876X
Citations 
PageRank 
References 
0
0.34
11
Authors
3
Name
Order
Citations
PageRank
Ben Li100.34
Manel Khlif-Bouassida201.01
Armand Toguyéni3366.59