Positive loop-closed automata: A decidable class of hybrid systems
From MaRDI portal
Recommendations
Cites work
- A calculus of durations
- A theory of timed automata
- Algorithmic analysis of nonlinear hybrid systems
- Decidable integration graphs.
- Efficient verification of a class of linear hybrid automata using linear programming
- Formal techniques in real-time and fault-tolerant systems. 3rd international symposium organized jointly with the working group provably correct systems -- ProCoS, Lübeck, Germany, September 19--23, 1994. Proceedings
- HyTech: A model checker for hybrid systems
- Symbolic model checking for rectangular hybrid systems
- The algorithmic analysis of hybrid systems
- The theory of hybrid automata
- What's decidable about hybrid automata?
Cited in
(4)
This page was built for publication: Positive loop-closed automata: A decidable class of hybrid systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1858439)