Advertisement

PHAVer: Algorithmic Verification of Hybrid Systems Past HyTech

  • Goran Frehse
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3414)

Abstract

In 1995, HyTech broke new ground as a potentially powerful tool for verifying hybrid systems – yet it has remained severely limited in its applicability to more complex systems. We address the main problems of HyTech with PHAVer, a new tool for the exact verification of safety properties of hybrid systems with piecewise constant bounds on the derivatives. Affine dynamics are handled by on-the-fly overapproximation and by partitioning the state space based on user-definable constraints and the dynamics of the system. PHAVer’s exact arithmetic is robust due to the use of the Parma Polyhedra Library, which supports arbitrarily large numbers. To manage the complexity of the polyhedral computations, we propose methods to conservatively limit the number of bits and constraints of polyhedra. Experimental results for a navigation benchmark and a tunnel diode circuit show the effectiveness of the approach.

Keywords

Hybrid System Reachable State Hybrid Automaton Reachability Analysis Split Crit 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Henzinger, T.A.: The theory of hybrid automata. In: Proc. IEEE Symp. Logic in Computer Science, LICS 1996, New Brunswick, New Jersey, July 27-30, pp. 278–292. IEEE Computer Society, Los Alamitos (1996)CrossRefGoogle Scholar
  2. 2.
    Ho, P.H.: Automatic Analysis of Hybrid Systems. PhD thesis, Cornell University, Technical Report CSD-TR95-1536 (1995)Google Scholar
  3. 3.
    Henzinger, T.A., Ho, P.H., Wong-Toi, H.: HYTECH: A model checker for hybrid systems. Int. Journal on Software Tools for Technology Transfer 1, 110–122 (1997)MATHCrossRefGoogle Scholar
  4. 4.
    Henzinger, T.A., Preussig, J., Wong-Toi, H.: Some lessons from the hytech experience. In: Proceedings of the 40th Annual Conference on Decision and Control (CDC 2001), pp. 2887–2892. IEEE Press, Los Alamitos (2001)Google Scholar
  5. 5.
    Cofer, D.D., Engstrom, E., Goldman, R.P., Musliner, D.J., Vestal, S.: Applications of model checking at Honeywell Laboratories. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol. 2057, pp. 296–303. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  6. 6.
    Bagnara, R., Ricci, E., Zaffanella, E., Hill, P.M.: Possibly not closed convex polyhedra and the Parma Polyhedra Library. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol. 2477, pp. 213–229. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  7. 7.
    Fehnker, A., Ivancic, F.: Benchmarks for hybrid systems verification. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol. 2993, pp. 326–341. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  8. 8.
    Gupta, S., Krogh, B.H., Rutenbar, R.A.: Towards formal verification of analog designs. In: Proc. IEEE Intl. Conf. on Computer-Aided Design (ICCAD 2004), San Jose, CA, USA, November 7–11 (2004)Google Scholar
  9. 9.
    Frehse, G., Han, Z., Krogh, B.H.: Assume-guarantee reasoning for hybrid i/o-automata by over-approximation of continuous interaction. In: Proc. IEEE Conf. Decision and Control (CDC 2004), Atlantis, Bahamas, December 14–17 (2004)Google Scholar
  10. 10.
    Henzinger, T.A., Horowitz, B., Majumdar, R., Wong-Toi, H.: Beyond HYTECH: Hybrid systems analysis using interval numerical methods. In: Lynch, N.A., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol. 1790, pp. 130–144. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  11. 11.
    Preussig, J., Kowalewski, S., Wong-Toi, H., Henzinger, T.A.: An algorithm for the approximative analysis of rectangular automata. In: Ravn, A.P., Rischel, H. (eds.) FTRTFT 1998. LNCS, vol. 1486, pp. 228–240. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  12. 12.
    Henzinger, T.A., Ho, P.H., Wong-Toi, H.: Hytech: the next generation. In: Proc. IEEE Real-Time Systems Symp. (RTSS 1995), pp. 56–65. IEEE Computer Society, Los Alamitos (1995)CrossRefGoogle Scholar
  13. 13.
    Henzinger, T.A., Ho, P.H., Wong-Toi, H.: Algorithmic analysis of nonlinear hybrid systems. IEEE Transactions on Automatic Control 43, 540–554 (1998)MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Stursberg, O., Krogh, B.H.: Efficient representation and computation of reachable sets for hybrid systems. In: Maler, O., Pnueli, A. (eds.) HSCC 2003. LNCS, vol. 2623, pp. 482–497. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  15. 15.
    Silva, B.I., Stursberg, O., Krogh, B.H., Engell, S.: An assessment of the current status of algorithmic approaches to the verification of hybrid systems. In: Proc. 40th Conference on Decision and Control, CDC 2001 (2001)Google Scholar
  16. 16.
    Lynch, N.A., Segala, R., Vaandrager, F.W.: Hybrid I/O automata. Information and Computation 185, 105–157 (2003)MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Ivancic, F.: Modeling and Analysis of Hybrid Systems. PhD thesis, University of Pennsylvania, Philadelphia, PA (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Goran Frehse
    • 1
  1. 1.Dept. of Electrical and Computer EngineeringCarnegie Mellon UniversityPittsburghUSA

Personalised recommendations