Incremental Search Methods for Reachability Analysis of Continuous and Hybrid Systems
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Hierarchical modeling and analysis of embedded systemsProceedings of the IEEE, 2003
- Reachability Analysis of Hybrid Systems via Predicate AbstractionLecture Notes in Computer Science, 2002
- Symbolic Reachability Computation for Families of Linear Vector FieldsJournal of Symbolic Computation, 2001
- The boundedness of all products of a pair of matrices is undecidableSystems & Control Letters, 2000
- Counterexample-Guided Abstraction RefinementLecture Notes in Computer Science, 2000
- Ellipsoidal Techniques for Reachability AnalysisLecture Notes in Computer Science, 2000
- Algorithmic analysis of nonlinear hybrid systemsIEEE Transactions on Automatic Control, 1998
- Cryptography: Policy and AlgorithmsPublished by Springer Nature ,1996
- The algorithmic analysis of hybrid systemsTheoretical Computer Science, 1995
- A theory of timed automataTheoretical Computer Science, 1994