Reachability analysis of linear systems with stepwise constant inputs
From MaRDI portal
Publication:271719
DOI10.1016/j.entcs.2013.12.005zbMath1334.68134OpenAlexW2048187985WikidataQ113317931 ScholiaQ113317931MaRDI QIDQ271719
Paul Hänsch, Ibtissem Ben Makhlouf, Stefan Kowalewski, Hilal Diab
Publication date: 19 April 2016
Full work available at URL: https://doi.org/10.1016/j.entcs.2013.12.005
Linear systems in control theory (93C05) Specification and verification (program logics, model checking, etc.) (68Q60) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Reachability analysis of linear systems using support functions
- What's decidable about hybrid automata?
- Ellipsoidal techniques for reachability analysis: Internal approximation
- Nineteen Dubious Ways to Compute the Exponential of a Matrix
- Constraints for Continuous Reachability in the Verification of Hybrid Systems
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
This page was built for publication: Reachability analysis of linear systems with stepwise constant inputs