Reachability verification for hybrid automata
Authors:
- 1 January 1998
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 190-204
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Algorithmic analysis of nonlinear hybrid systemsIEEE Transactions on Automatic Control, 1998
- Automatic symbolic verification of embedded systemsIEEE Transactions on Software Engineering, 1996
- The algorithmic analysis of hybrid systemsTheoretical Computer Science, 1995
- What's decidable about hybrid automata?1995
- A theory of timed automataTheoretical Computer Science, 1994
- Symbolic verification with periodic sets1994
- Verification of linear hybrid systems by means of convex approximations1994
- Integration Graphs: A class of decidable hybrid systems1993
- A calculus of durationsInformation Processing Letters, 1991
- Software requirements analysis for real-time process-control systemsIEEE Transactions on Software Engineering, 1991