On the Decidability and Complexity of Diagnosability for Labeled Petri Nets

DOI10.1109/TAC.2017.2699278MaRDI QIDQ4566964zbMATH OpenOpenAlexFDO

Authors Xiang Yin, Stéphane Lafortune

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)

Cited in

(14)

• K-diagnosability analysis of bounded and unbounded Petri nets using linear optimization
• A semi-symbolic diagnoser for fault diagnosis of bounded labeled Petri nets
• Deciding detectability for labeled Petri nets
• Trajectory detectability of discrete-event systems
• Corrections to “On the Decidability and Complexity of Diagnosability for Labeled Petri Nets” [Nov 17 5931-5938]
• On detectability of labeled Petri nets and finite automata
• Diagnosis on a sliding window for partially observable Petri nets
• Marking diagnosability verification in labeled Petri nets
• A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems
• Diagnosability of labeled \(\mathfrak{D}_{\mathfrak{p}}\)-automata
• The complexity of diagnosability and opacity verification for Petri nets
• Diagnosability of fault patterns with labeled stochastic Petri nets
• Diagnosability enforcement in labeled Petri nets using supervisory control
• Codiagnosability of discrete event systems revisited: a new necessary and sufficient condition and its applications

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4566964)