On the verification of detectability for timed discrete event systems

DOI10.1016/J.AUTOMATICA.2024.111644MaRDI QIDQ6550243zbMATHFDO

Authors Weijie Dong, Kuize Zhang, Shaoyuan Li, Xiang Yin

Publication date 5 June 2024

Published in Automatica (Search for Journal in Brave)

zbMATH Keywords

detectabilitystate estimatepartially-observed timed automata

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Estimation and detection in stochastic control theory (93E10)

Recommendations

• An improved approach for verifying delayed detectability of discrete-event systems
• On verification of D-detectability for discrete event systems
• Complexity of deciding detectability in discrete event systems
• Detectability in stochastic discrete event systems
• Trajectory detectability of discrete-event systems

Cites work

• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• A polynomial algorithm for testing diagnosability of discrete-event systems
• A theory of timed automata
• Analysis of strong and strong periodic detectability of bounded labeled Petri nets
• Complexity of deciding detectability in discrete event systems
• Deciding detectability for labeled Petri nets
• Delayed Detectability of Discrete Event Systems
• Detectability in stochastic discrete event systems
• Detectability of Discrete Event Systems
• Enforcing Detectability in Controlled Discrete Event Systems
• Estimation and inference in discrete event systems. A model-based approach with finite automata
• Fault diagnosis for timed automata
• Introduction to Discrete Event Systems
• Marking Estimation in a Class of Time Labeled Petri Nets
• Observer Construction for Polynomially Ambiguous Max-Plus Automata
• Observers for a Class of Timed Automata Based on Elapsed Time Graphs
• On detectability of labeled Petri nets and finite automata
• On verification of D-detectability for discrete event systems
• Polynomial-time verification of diagnosability of partially observed discrete-event systems
• State Estimation and Fault Diagnosis of Labeled Time Petri Net Systems With Unobservable Transitions
• State estimation of max-plus automata with unobservable events
• State-based opacity of real-time automata
• Symbolic model checking for real-time systems
• The Complexity of Codiagnosability for Discrete Event and Timed Systems
• The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete
• Trajectory detectability of discrete-event systems
• Using branching time temporal logic to synthesize synchronization skeletons
• Verification of Detectability for Unambiguous Weighted Automata
• Verification of detectability in probabilistic finite automata

Cited in

(1)

• Path detectability verification for time-dependent systems with application to flexible manufacturing systems

This page was built for publication: On the verification of detectability for timed discrete event systems

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