On the verification of detectability for timed discrete event systems

Cites Work

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

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)