On the Decidability and Complexity of Diagnosability for Labeled Petri Nets

@article{Yin2017OnTD,
  title={On the Decidability and Complexity of Diagnosability for Labeled Petri Nets},
  author={Xiang Yin and Stx00E9phane Lafortune},
  journal={IEEE Transactions on Automatic Control},
  year={2017},
  volume={62},
  pages={5931-5938}
}
In this paper, we investigate the decidability and complexity of the fault diagnosis problem in unbounded labeled Petri nets. First, we show that checking diagnosability for unbounded Petri nets is decidable. We present a new necessary and sufficient condition for diagnosability, which can be reduced to a model checking problem for unbounded Petri nets. Then, we show that checking diagnosability for unbounded Petri nets is EXPSPACE-complete. This complexity result is further extended to various… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
6 Citations
36 References
Similar Papers

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…