Marking diagnosability verification in labeled Petri nets
From MaRDI portal
Publication:2665360
DOI10.1016/j.automatica.2021.109713zbMath1478.93412MaRDI QIDQ2665360
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
Related Items
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
