Reachability Analysis via Face Lifting
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science)
The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science)
GRKLib: a Guaranteed Runge Kutta Library
SCAN '06 Proceedings of the 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics
A verification framework for hybrid systems
A verification framework for hybrid systems
Generating and Analyzing Symbolic Traces of Simulink/Stateflow Models
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Robustness of temporal logic specifications for continuous-time signals
Theoretical Computer Science
Robust test generation and coverage for hybrid systems
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
A step towards verification and synthesis from simulink/stateflow models
Proceedings of the 14th international conference on Hybrid systems: computation and control
S-taliro: a tool for temporal logic falsification for hybrid systems
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Verification of annotated models from executions
Proceedings of the Eleventh ACM International Conference on Embedded Software
| Hi-index | 0.00 |
This paper presents an algorithm which uses simulation traces and formal models for computing overapproximations of reach sets of deterministic hybrid systems. The implementation of the algorithm in a tool, Hybrid Trace Verifier (HTV), uses Mathwork's Simulink/Stateflow (SLSF) environment for generating simulation traces and for obtaining formal models. Computation of the overapproximation relies on computing error bounds in the dynamics obtained from the formal model. Verification results from three case studies, namely, a version of the navigation benchmark, an engine control system, and a satellite system suggest that this combined formal analysis and simulation based approach may scale to larger problems.