Trajectory Based Verification Using Local Finite-Time Invariance
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Robustness of temporal logic specifications for continuous-time signals
Theoretical Computer Science
Verification and Control of Hybrid Systems: A Symbolic Approach
Verification and Control of Hybrid Systems: A Symbolic Approach
Monte-carlo techniques for falsification of temporal properties of non-linear hybrid systems
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Bayesian statistical model checking with application to Simulink/Stateflow verification
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Robust test generation and coverage for hybrid systems
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
SpaceEx: scalable verification of hybrid systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Control design for specifications on stochastic hybrid systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
Probabilistic Temporal Logic Falsification of Cyber-Physical Systems
ACM Transactions on Embedded Computing Systems (TECS) - Special Section on Probabilistic Embedded Computing
| Hi-index | 0.00 |
In this paper, we address the problem of local search for the falsification of hybrid automata with affine dynamics. Namely, given a sequence of locations and a maximum simulation time, we return the trajectory that comes closest to the unsafe set. This problem is formulated as a differentiable optimization problem and solved. The purpose of developing such a local search method is to combine it with high level stochastic optimization algorithms in order to falsify hybrid systems with complex discrete dynamics and high dimensional continuous spaces. Experimental results indicate that the local search procedure improves upon the results of pure stochastic optimization algorithms.