Analysis of strong and strong periodic detectability of bounded labeled Petri nets

DOI10.1016/j.nahs.2021.101087zbMath1478.93400OpenAlexW3183805321MaRDI QIDQ2060875

Carla Seatzu, Yin Tong, Hao Lan

Publication date: 13 December 2021

Published in: Nonlinear Analysis. Hybrid Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.nahs.2021.101087

zbMATH Keywords

state estimationPetri netsdiscrete event systemsdetectability

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Attainable sets, reachability (93B03)

Cites Work

• Verification of initial-state opacity in security applications of discrete event systems
• Generalized detectability for discrete event systems
• Fault detection for discrete event systems using Petri nets with unobservable transitions
• Opacity of discrete event systems and its applications
• Detectability in stochastic discrete event systems
• Diagnosability of discrete event systems and its applications
• Verification of detectability in probabilistic finite automata
• Verification complexity of a class of observational properties for modular discrete events systems
• Detection and mitigation of classes of attacks in supervisory control systems
• Trajectory detectability of discrete-event systems
• Deciding detectability for labeled Petri nets
• Detectability of networked discrete event systems
• Complexity of deciding detectability in discrete event systems
• Verification of C-detectability using Petri nets
• On detectability of labeled Petri nets and finite automata
• Initial-state detectability of stochastic discrete-event systems with probabilistic sensor failures
• The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete
• A Uniform Approach for Synthesizing Property-Enforcing Supervisors for Partially-Observed Discrete-Event Systems
• Design of Optimal Petri Net Controllers for Disjunctive Generalized Mutual Exclusion Constraints
• Introduction to Discrete Event Systems
• Observability of discrete event dynamic systems
• A polynomial algorithm for testing diagnosability of discrete-event systems
• Finding All the Elementary Circuits of a Directed Graph
• Fault diagnosis in discrete-event systems: Framework and model reduction
• Observability of place/transition nets
• Polynomial-time verification of diagnosability of partially observed discrete-event systems
• Detectability of Discrete Event Systems
• Basis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem
• Verification of State-Based Opacity Using Petri Nets
• A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets
• Delayed Detectability of Discrete Event Systems
• Enforcing Detectability in Controlled Discrete Event Systems
• Attack Detection and Identification in Cyber-Physical Systems
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Analysis of strong and strong periodic detectability of bounded labeled Petri nets