On-the-fly diagnosability analysis of LPN using verifier nets
| Autor: | Manel Khlif-Bouassida, Ben Li, Armand Toguyoni |
|---|---|
| Přispěvatelé: | PRES Université Lille Nord de France |
| Jazyk: | angličtina |
| Rok vydání: | 2016 |
| Předmět: |
Discrete mathematics
0209 industrial biotechnology Computational complexity theory On the fly Computation 02 engineering and technology Petri net 020901 industrial engineering & automation Reachability Bounded function [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering 0202 electrical engineering electronic engineering information engineering Graph (abstract data type) 020201 artificial intelligence & image processing Combinatorial explosion ComputingMilieux_MISCELLANEOUS Mathematics |
| Zdroj: | 2016 3rd Conference on Control and Fault-Tolerant Systems (SysTol) 2016 3rd Conference on Control and Fault-Tolerant Systems (SysTol), Sep 2016, Barcelona, France. ⟨10.1109/SYSTOL.2016.7739768⟩ |
| DOI: | 10.1109/SYSTOL.2016.7739768⟩ |
| Popis: | In this paper, the on-the-fly diagnosability analysis using Verifier Nets (VN) is developed. The objective is to improve the VN approach by using on-the-fly diagnosability analysis technique. The diagnosability is analyzed in the framework of bounded and unbounded labeled Petri nets (LPN) with no deadlock after firing any fault transition. The VN and its reachability graph (for bounded LPN)/ coverability graph (for unbounded LPN) are built on-the-fly and in parallel for diagnosability analysis. Stop conditions are proposed to stop the construction as soon as a diagnosability decision is established. This approach achieves a compromise between computation efficiency and combinatorial explosion limitation. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|