<abstract xmlns="http://www.w3.org/1999/xhtml"><p> 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.</p></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.

On–The–Fly Diagnosability Analysis of Bounded and Unbounded Labeled Petri Nets Using Verifier Nets

International Journal of Applied Mathematics and Computer Science

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

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...

On–The–Fly Diagnosability Analysis of Bounded and Unbounded Labeled Petri Nets Using Verifier Nets

Published Online: Jun 29, 2018

Page range: 269 - 281

Received: Mar 15, 2017

Accepted: Jan 29, 2018

DOI: https://doi.org/10.2478/amcs-2018-0019

Keywords
fault diagnosis, discrete event systems, labeled Petri nets, on-the-fly diagnosability analysis, verifier nets

© 2018 Ben Li, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

On–The–Fly Diagnosability Analysis of Bounded and Unbounded Labeled Petri Nets Using Verifier Nets

Published Online: Jun 29, 2018

Page range: 269 - 281

Received: Mar 15, 2017

Accepted: Jan 29, 2018

DOI: https://doi.org/10.2478/amcs-2018-0019

Keywordsfault diagnosis, discrete event systems, labeled Petri nets, on-the-fly diagnosability analysis, verifier nets

© 2018 Ben Li, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Keywords
fault diagnosis, discrete event systems, labeled Petri nets, on-the-fly diagnosability analysis, verifier nets