Corrections to “On the Decidability and Complexity of Diagnosability for Labeled Petri Nets” [Nov 17 5931-5938]

DOI10.1109/TAC.2019.2897511zbMATH Open1482.93402MaRDI QIDQ5223685FDOQ5223685

Authors Xiang Yin, Stéphane Lafortune 

Publication date 18 July 2019

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

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)

Recommendations

• On the Decidability and Complexity of Diagnosability for Labeled Petri Nets
• Marking diagnosability verification in labeled Petri nets
• On-the-fly diagnosability analysis of bounded and unbounded labeled Petri nets using verifier nets
• The complexity of diagnosability and opacity verification for Petri nets
• The complexity of diagnosability and opacity verification for Petri nets
• Divergence Properties of Labeled Petri Nets and Their Relevance for Diagnosability Analysis
• Codiagnosability Enforcement in Labeled Petri Nets
• Diagnosability analysis of patterns on bounded labeled prioritized Petri nets
• Diagnosability Analysis of Labeled Time Petri Net Systems
• On \(\mathcal K\)-diagnosability of Petri nets via integer linear programming

Cited in

(3)

• The complexity of diagnosability and opacity verification for Petri nets
• Correction to: ``Arborescent architecture for decentralized diagnosis of discrete event systems
• Comments on ``Polynomial time verification of decentralized diagnosability of discrete event systems versus ``Decentralized failure diagnosis of discrete event systems: complexity clarification

This page was built for publication: Corrections to “On the Decidability and Complexity of Diagnosability for Labeled Petri Nets” [Nov 17 5931-5938]

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