期刊名称：International Journal of Applied Mathematics and Computer Science
电子版ISSN：2083-8492
出版年度：2018
卷号：28
期号：2
页码：1-13
DOI：10.2478/amcs-2018-0019
出版社：De Gruyter Open
摘要：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.
