Reachability verification for hybrid automata

  • Thomas A. Henzinger
  • Vlad Rusu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1386)


We study the reachability problem for hybrid automata. Automatic approaches, which attempt to construct the reachable region by symbolic execution, often do not terminate. In these cases, we require the user to guess the reachable region, and we use a theorem prover (Pvs) to verify the guess. We classify hybrid automata according to the theory in which their reachable region can be defined finitely. This is the theory in which the prover needs to operate in order to verify the guess. The approach is interesting, because an appropriate guess can often be deduced by extrapolating from the first few steps of symbolic execution.


shybrid automata reachability verification theorem proving 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. ACH5.
    ACH+5. R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3–34, 1995.Google Scholar
  2. AD94.
    R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235, 1994.CrossRefGoogle Scholar
  3. AHH96.
    R. Alur, T.A. Henzinger, and P.-H. Ho. Automatic symbolic verificationof embedded systems. IEEE Ransactions on Software Engineering, 22(3):181–201, 1996.Google Scholar
  4. BBR97.
    B. Boigelot, L. Bronne, and S. Rassart. An improved reachability analysis method for strongly linear hybrid systems. In Proc. of the 9th Conference on Computer-Aided Verification, CAV'97, LNCS 1254, pages 167–178. Springer-Verlag, 1997.Google Scholar
  5. BR97.
    A. Burgue≈no and V. Rusu. Task-system analysis using slope-parametric hybrid automata. In Proc. of the 3rd Conference on Parallel Processing, Euro-Par'97, LNCS 1300, pages 1262–1273. Springer-Verlag, 1997.Google Scholar
  6. BW94.
    B. Boigelot and P. Wolper. Symbolic verification with periodic sets. In Proc. of the 6th Conference on Computer-Aided Verification, CAV'94, LNCS 818, pages 55–67. Springer-Verlag, 1994.Google Scholar
  7. CHR91.
    Z. Chaochen, C.A.R. Hoare, and A.P. Ravn. A calculus of durations. Information Processing Letters, 40:269–276, 1991.Google Scholar
  8. HHWT98.
    T.A. Henzinger, P.-H. Ho, and H. Wong-Toi. Algorithmic analysis of nonlinear hybrid systems. IEEE Transactions on Automatic Control, 1998. To appear.Google Scholar
  9. HKPV95.
    T.A. Henzinger, P.W. Kopke, A. Puri, and P. Varaiya. What's decidable about hybrid automata? In Proc. of the 27th Annual ACM Symposium on Theory of Computing, STOC'95, pages 373–382, 1995.Google Scholar
  10. HPR94.
    N. Halbwachs, Y.-E. Proy, and P. Raymond. Verification of linear hybrid systems by means of convex approximations. In Proc. of the 1st Static Analysis Symposium, SAS'94, LNCS 864, pages 223–237. Springer-Verlag, 1994.Google Scholar
  11. JLHM91.
    M. Jaffe, N. Levenson, M. Heimdahl, and B. Melhart. Software requirements analysis for real-time process-control systems. IEEE Transactions on Software Engineering, 17(3):241–258, 1991.Google Scholar
  12. KPSY93.
    Y. Kesten, A. Pnueli, J. Sifakis, and S. Yovine. Integration graphs: a class of decidable hybrid systems. In Proc. of the 1st Workshop on Theory of Hybrid Systems, LNCS 736, pages 179–208. Springer-Verlag, 1993.Google Scholar
  13. ORR96.
    S. Owre, S. Rajan, J.M. Rushby, N. Shankar, and M.K. Srivas. Pvs: Combining specification, proof checking, and model checking. In Proc. of the 8th Conference on Computer-Aided Verification, CAV.'96, LNCS 1102, pages 411–414. Springer-Verlag, 1996.Google Scholar
  14. RR96.
    O. Roux and V. Rusu. Uniformity for the decidability of hybrid automata. In Proc. of the 3rd Static Analysis Symposium, SAS'96, LNCS 1145, pages 301–316. Springer-Verlag, 1996.Google Scholar
  15. VH96.
    Jan Vitt and Josef Hooman. Assertional specification and verification using Pvs of the steam boiler control system. In Formal Methods for Industrial Applications: Specifying and Programming the Steam Boiler Control, LNCS 1165, pages 453–472. Springer-Verlag, 1996.Google Scholar
  16. Zie95.
    G. M. Ziegler. Lectures on Polytopes, volume 152 of Graduate Texts in Mathematics. Springer-Verlag, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Thomas A. Henzinger
    • 1
  • Vlad Rusu
    • 2
  1. 1.EECS DepartmentUniversity of CaliforniaBerkeley
  2. 2.SRI InternationalComputer Science LaboratoryMenlo Park

Personalised recommendations