Zhenqi Huang
Sayan Mitra
ABSTRACT
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.
- Y. Annapureddy, C. Liu, G. Fainekos, and S. Sankaranarayanan. S-taliro: A tool for temporal logic falsification for hybrid systems. In TACAS, 2011. Google Scholar
Digital Library
- E. Asarin, O. Bournez, T. Dang, and O. Maler. Approximate reachability analysis of piecewise-linear dynamical systems. In HSCC, volume 1790, pages 20--31, 2000. Google ScholarDigital Library
- O. Bouissou and M. Martel. Grklib: a guaranteed runge kutta library. In IMACS, 2006. Google ScholarDigital Library
- T. Dang and O. Maler. Reachability analysis via face lifting. In HSCC. Springer-Verlag, 1998. Google ScholarDigital Library
- G. E. Fainekos and G. J. Pappas. Robustness of temporal logic specifications for continuous-time signals. TCS, 410:4262--4291, September 2009. Google ScholarDigital Library
- A. Fehnker and F. Ivancic. Benchmarks for hybrid systems verification. In R. Alur and G. J. Pappas, editors, HSCC, volume 2993 of LNCS, pages 326--341. Springer, 2004.Google Scholar
- A. A. Julius, G. E. Fainekos, M. Anand, I. Lee, and G. J. Pappas. Robust test generation and coverage for hybrid systems. In A. Bemporad, A. Bichi, and G. Buttazzo, editors, HSCC, volume 4416 of LNCS, pages 329--342. Springer, 2007. Google ScholarDigital Library
- A. Kanade, R. Alur, F. Ivancic, S. Ramesh, S. Sankaranarayanan, and K. Shashidhar. Generating and analyzing symbolic traces of simulink/stateflow models. In CAV, 2009. Google ScholarDigital Library
- D. K. Kaynar, N. Lynch, R. Segala, and F. Vaandrager. The Theory of Timed I/O Automata. Synthesis Lectures on Computer Science. Morgan Claypool, November 2005. Also available as Technical Report MIT-LCS-TR-917. Google ScholarDigital Library
- K.-D. Kim, S. Mitra, and P. R. Kumar. Bounded epsilon-reachability of linear hybrid automata with a deterministic and transversal discrete transition condition. In CDC, 2010.Google Scholar
- K. Manamcheri. Translation of simulink/stateflow models to hybrid automata. Master's thesis, University of Illinois at Urbana-Champaign, 2011.Google Scholar
- K. Manamcheri, S. Mitra, S. Bak, and M. Caccamo. A step towards verification and synthesis from simulink/stateflow models. In HSCC, 2011. Google ScholarDigital Library
- S. Mitra. A Verification Framework for Hybrid Systems. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA 02139, September 2007. Google ScholarDigital Library
Index Terms
- Computing bounded reach sets from sampled simulation traces
Recommendations
Bounded model checking of high-integrity software
HILT '13: Proceedings of the 2013 ACM SIGAda annual conference on High integrity language technologyModel checking [5] is an automated algorithmic technique for exhaustive verification of systems, described as finite state machines, against temporal logic [9] specifications. It has been used successfully to verify hardware at an industrial scale [6]. ...
Handling loops in bounded model checking of C programs via k-induction
The first attempts to apply the k-induction method to software verification are only recent. In this paper, we present a novel proof by induction algorithm, which is built on the top of a symbolic context-bounded model checker and uses an iterative ...
Formal Verification and Simulation: Co-verification for Subway Control Systems
TASE '12: Proceedings of the 2012 Sixth International Symposium on Theoretical Aspects of Software EngineeringFor hybrid systems, hybrid automata based tools are capable of verification while Matlab Simulink/Stateflow is proficient in simulation. In this paper, a methodology is developed in which the formal verification tool PHAVer and simulation tool Matlab ...
Comments