Observers for a Class of Timed Automata Based on Elapsed Time Graphs
From MaRDI portal
Cited in
(10)- State estimation of timed probabilistic discrete event systems via artificial neural networks
- Observability of extended timed event graph
- Verification of current-state opacity and opaque time for labeled time Petri net systems
- Diagnosis of timed patterns for discrete event systems by means of state isolation
- On clock interval automata for a class of time PNs
- Symbolic state estimation in bounded timed labeled Petri nets
- New insights into opacity verification in timed discrete-event systems
- State estimation for constant-time labeled automata under dense time
- Detectability of labeled weighted automata over monoids
- On the verification of detectability for timed discrete event systems
This page was built for publication: Observers for a Class of Timed Automata Based on Elapsed Time Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5034071)