Marking diagnosability verification in labeled Petri nets
From MaRDI portal
Publication:2665360
Recommendations
- Codiagnosability Enforcement in Labeled Petri Nets
- On the Decidability and Complexity of Diagnosability for Labeled Petri Nets
- On-the-fly diagnosability analysis of bounded and unbounded labeled Petri nets using verifier nets
- scientific article; zbMATH DE number 6936874
- Diagnosability enforcement in labeled Petri nets using supervisory control
- Diagnosability Analysis of Labeled Time Petri Net Systems
- Marking Predictability and Prediction in Labeled Petri Nets
- Diagnosability of Petri nets with observation graphs
- Probabilistic Marking Estimation in Labeled Petri Nets
Cites work
- A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets
- A branch and bound approach for the design of decentralized supervisors in Petri net models
- A general approach for optimizing dynamic sensor activation for discrete event systems
- A polynomial algorithm for testing diagnosability of discrete-event systems
- Basis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem
- Codiagnosability Analysis of Bounded Petri Nets
- Codiagnosability and coobservability under dynamic observations: transformation and verification
- Decentralized Prognosis of Failures in Discrete Event Systems
- Diagnosability Analysis of Labeled Time Petri Net Systems
- Diagnosability of discrete-event systems
- Diagnosability of intermittent sensor faults in discrete event systems
- Enforcement of Diagnosability in Labeled Petri Nets via Optimal Sensor Selection
- Fault detection for discrete event systems using Petri nets with unobservable transitions
- Fault diagnosis in discrete-event systems: incorporating timing information
- On \(\mathcal K\)-diagnosability of Petri nets via integer linear programming
- Polynomial Time Verification of Decentralized Diagnosability of Discrete Event Systems
- Polynomial-time verification of diagnosability of partially observed discrete-event systems
- Synthesis of Maximally-Permissive Supervisors for the Range Control Problem
- The Diagnosability of Petri Net Models Using Minimal Explanations
- Verification of State-Based Opacity Using Petri Nets
Cited in
(19)- K-diagnosability analysis of bounded and unbounded Petri nets using linear optimization
- Supervisor synthesis for asynchronous diagnosability enforcement in labeled Petri nets
- A semi-symbolic diagnoser for fault diagnosis of bounded labeled Petri nets
- Deciding detectability for labeled Petri nets
- Verification of C-detectability using Petri nets
- Corrections to “On the Decidability and Complexity of Diagnosability for Labeled Petri Nets” [Nov 17 5931-5938]
- Optimal sensor selection for ensuring diagnosability in labeled Petri nets
- Diagnosability of Petri nets with observation graphs
- Finding a witness path for non-liveness in free-choice nets
- The complexity of diagnosability and opacity verification for Petri nets
- Diagnosability of fault patterns with labeled stochastic Petri nets
- On-the-fly diagnosability analysis of bounded and unbounded labeled Petri nets using verifier nets
- Diagnosability enforcement in labeled Petri nets using supervisory control
- Basis coverability graph for partially observable Petri nets with application to diagnosability analysis
- On \(\mathcal K\)-diagnosability of Petri nets via integer linear programming
- Diagnosability verification using LTL model checking
- Diagnosability analysis of patterns on bounded labeled prioritized Petri nets
- Probabilistic Marking Estimation in Labeled Petri Nets
- Liveness and deadlock-freeness verification and enforcement in bounded Petri nets using basis reachability graphs
This page was built for publication: Marking diagnosability verification in labeled Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2665360)
