Marking diagnosability verification in labeled Petri nets

DOI10.1016/j.automatica.2021.109713zbMath1478.93412OpenAlexW3170812736MaRDI QIDQ2665360

Xiang Yin, Ziyue Ma, Zhiwu Li

Publication date: 19 November 2021

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2021.109713

zbMATH Keywords

discrete event systemPetri netbasis reachability graphmarking diagnosability

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Attainable sets, reachability (93B03)

Related Items (2)

Diagnosability enforcement in labeled Petri nets using supervisory control ⋮ Diagnosability of fault patterns with labeled stochastic Petri nets

Cites Work

• Fault detection for discrete event systems using Petri nets with unobservable transitions
• Codiagnosability and coobservability under dynamic observations: transformation and verification
• On \(\mathcal K\)-diagnosability of Petri nets via integer linear programming
• A general approach for optimizing dynamic sensor activation for discrete event systems
• A branch and bound approach for the design of decentralized supervisors in Petri net models
• Diagnosability of intermittent sensor faults in discrete event systems
• A polynomial algorithm for testing diagnosability of discrete-event systems
• Codiagnosability Analysis of Bounded Petri Nets
• Synthesis of Maximally-Permissive Supervisors for the Range Control Problem
• Diagnosability of discrete-event systems
• Decentralized Prognosis of Failures in Discrete Event Systems
• The Diagnosability of Petri Net Models Using Minimal Explanations
• Enforcement of Diagnosability in Labeled Petri Nets via Optimal Sensor Selection
• Polynomial-time verification of diagnosability of partially observed discrete-event systems
• Fault diagnosis in discrete-event systems: incorporating timing information
• Basis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem
• Diagnosability Analysis of Labeled Time Petri Net Systems
• Polynomial Time Verification of Decentralized Diagnosability of Discrete Event Systems
• Verification of State-Based Opacity Using Petri Nets
• A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets

This page was built for publication: Marking diagnosability verification in labeled Petri nets