Efficient Computation of Reachable Sets of Linear Time-Invariant Systems with Inputs
Authors:
Top Cited Papers
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 257-271
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- PHAVer: Algorithmic Verification of Hybrid Systems Past HyTech2005
- Computational techniques for hybrid system verificationIEEE Transactions on Automatic Control, 2003
- Control from computer scienceAnnual Reviews in Control, 2002
- Towards an optimal control of the wrapping effect1999
- Rigorously computed orbits of dynamical systems without the wrapping effectComputing, 1998
- HYTECH: a model checker for hybrid systemsInternational Journal on Software Tools for Technology Transfer, 1997
- Reachability analysis of dynamical systems having piecewise-constant derivativesTheoretical Computer Science, 1995
- The algorithmic analysis of hybrid systemsTheoretical Computer Science, 1995
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanesMemoirs of the American Mathematical Society, 1975