Computer Science – Logic in Computer Science
Scientific paper
2006-11-13
Computer Science
Logic in Computer Science
11 pages, 2 figures
Scientific paper
This draft suggests a new counterexample guided abstraction refinement (CEGAR) framework that uses the combination of numerical simulation for nonlinear differential equations with linear programming for linear hybrid automata (LHA) to perform reachability analysis on nonlinear hybrid automata. A notion of $\epsilon-$ structural robustness is also introduced which allows the algorithm to validate counterexamples using numerical simulations. Keywords: verification, model checking, hybrid systems, hybrid automata, robustness, robust hybrid systems, numerical simulation, cegar, abstraction refinement.
No associations
LandOfFree
Numerical Simulation guided Lazy Abstraction Refinement for Nonlinear Hybrid Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Numerical Simulation guided Lazy Abstraction Refinement for Nonlinear Hybrid Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Numerical Simulation guided Lazy Abstraction Refinement for Nonlinear Hybrid Automata will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-669240