On the Decidability and Complexity of Diagnosability for Labeled Petri Nets

DOI10.1109/TAC.2017.2699278zbMath1390.93539OpenAlexW2607898266MaRDI QIDQ4566964

Stéphane Lafortune, Xiang Yin

Publication date: 27 June 2018

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2017.2699278

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (8)

Diagnosability enforcement in labeled Petri nets using supervisory control ⋮ On detectability of labeled Petri nets and finite automata ⋮ Diagnosability of fault patterns with labeled stochastic Petri nets ⋮ Trajectory detectability of discrete-event systems ⋮ Codiagnosability of discrete event systems revisited: a new necessary and sufficient condition and its applications ⋮ Deciding detectability for labeled Petri nets ⋮ A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems ⋮ \(K\)-diagnosability analysis of bounded and unbounded Petri nets using linear optimization

This page was built for publication: On the Decidability and Complexity of Diagnosability for Labeled Petri Nets