Approximate Reachability for Linear Systems
- 14 March 2003
- book chapter
- Published by Springer Nature
- p. 514-525
- https://doi.org/10.1007/3-540-36580-x_37
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A theory of timed automataPublished by Elsevier ,2002
- Reach Set Computations Using Real Quantifier EliminationPublished by Springer Nature ,2001
- Discrete abstractions of hybrid systemsProceedings of the IEEE, 2000
- Ellipsoidal Techniques for Reachability AnalysisPublished by Springer Nature ,2000
- A New Class of Decidable Hybrid SystemsPublished by Springer Nature ,1999
- Verification of Polyhedral-Invariant Hybrid Automata Using Polygonal Flow Pipe ApproximationsPublished by Springer Nature ,1999
- What's Decidable about Hybrid Automata?Journal of Computer and System Sciences, 1998
- Reachability analysis via face liftingPublished by Springer Nature ,1998
- The algorithmic analysis of hybrid systemsTheoretical Computer Science, 1995
- Longitudinal control of the lead car of a platoonIEEE Transactions on Vehicular Technology, 1994