Polynomial-time verification of pattern diagnosability for timed discrete event systems
From MaRDI portal
Cites work
- A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets
- A polynomial algorithm for testing diagnosability of discrete-event systems
- A theory of timed automata
- Analysis and control of timed event graphs in (max,+) algebra for the active localization of time failures
- Design of Supervisors for Active Diagnosis in Discrete Event Systems
- Diagnosability Analysis of Labeled Time Petri Net Systems
- Diagnosability of discrete event systems and its applications
- Diagnosability of discrete-event systems
- Diagnosis of timed patterns for discrete event systems by means of state isolation
- Estimation and inference in discrete event systems. A model-based approach with finite automata
- Fault diagnosis for timed automata
- Fault diagnosis in discrete-event systems: incorporating timing information
- Foundations of Software Science and Computational Structures
- Introduction to Discrete Event Systems
- Petri nets. Theoretical models and analysis methods for concurrent systems
- Polynomial-time verification of diagnosability of partially observed discrete-event systems
- State estimation in labeled time Petri net systems using observed modified state class graph
- Supervisory control of discrete-event systems
- Supervisory control of timed discrete-event systems
This page was built for publication: Polynomial-time verification of pattern diagnosability for timed discrete event systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6990452)
