Timed initial-state detectability of discrete-event systems by algebraic method
From MaRDI portal
Cites work
- A theory of timed automata
- A unified framework for verification of observational properties for partially-observed discrete-event systems
- Depth-First Search and Linear Graph Algorithms
- Detectability of Discrete Event Systems
- Detectability of labeled weighted automata over monoids
- Estimation and inference in discrete event systems. A model-based approach with finite automata
- General algorithms for testing the ambiguity of finite automata and the double-tape ambiguity of finite-state transducers
- Generalized detectability for discrete event systems
- Handbook of weighted automata
- scientific article; zbMATH DE number 1163636 (Why is no real title available?)
- scientific article; zbMATH DE number 2085321 (Why is no real title available?)
- scientific article; zbMATH DE number 7646025 (Why is no real title available?)
- I-S detectability of partially-observed discrete event systems: a novel matrix-based method
- Initial-state detectability and initial-state opacity of unambiguous weighted automata
- Initial-state detectability of stochastic discrete-event systems with probabilistic sensor failures
- Interval arithmetic: from principles to implementation
- Matrix approach to I-detectability of partially observed discrete event systems
- On the verification of detectability for timed discrete event systems
- Real-time automata
- State estimation of timed automata under partial observation
This page was built for publication: Timed initial-state detectability of discrete-event systems by algebraic method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6885123)
