Hybrid diagrams: A deductive-algorithmic approach to hybrid system verification

  • Luca de Alfaro
  • Arjun Kapur
  • Zohar Manna
Specification and Verification
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1200)

Abstract

We present a methodology for the verification of temporal properties of hybrid systems. The methodology is based on the deductive transformation of hybrid diagrams, which represent the system and its properties, and which can be algorithmically checked against the specification. This check either gives a positive answer to the verification problem, or provides guidance for the further transformation of the diagrams. The resulting methodology is complete for quantifier-free linear-time temporal logic.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R. Alur, C. Courcoubebetis, N. Halbwachs, T.A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theor. Comp. Sci., 138(1):3–34, 1995.CrossRefGoogle Scholar
  2. 2.
    R. Alur, C. Courcoubetis, T. Henzinger, and P. Ho. Hybrid automata: An algorithmic approach to the specification and analysis of hybrid systems. In Workshop on Hybrid Systems, volume 736 of Lect. Notes in Comp. Sci., pages 209–229. Springer-Verlag, 1993.Google Scholar
  3. 3.
    Z. Chaochen, A.P. Ravn, and M.R. Hansen. An extended duration calculus for hybrid real-time systems. In Hybrid Systems, volume 736 of Lect. Notes in Comp. Sci., pages 36–59. Springer-Verlag, 1993.Google Scholar
  4. 4.
    L. de Alfaro and Z. Manna. Temporal verification by diagram transformations. In Computer Aided Verification, volume 1102 of Lect. Notes in Comp. Sci., pages 288–299. Springer-Verlag, 1996.Google Scholar
  5. 5.
    A. Kapur, T.A. Henzinger, Z. Manna, and A. Pnueli. Proving safety properties of hybrid systems. In FTRTFT'94, volume 863 of Lect. Notes in Comp. Sci., pages 431–454. Springer-Verlag, 1994.Google Scholar
  6. 6.
    Y. Kesten, Z. Manna, and A. Pnueli. Verifying clocked transition systems. In Hybrid Systems III, volume 1066 of Lect. Notes in Comp. Sci., pages 13–40. Springer-Verlag, 1996.Google Scholar
  7. 7.
    L. Lamport. Hybrid systems in TLA+. In Hybrid Systems, volume 736 of Lect. Notes in Comp. Sci., pages 77–102. Springer-Verlag, 1993.Google Scholar
  8. 8.
    N.A. Lynch and H. Attiya. Using mappings to prove timing properties. Distributed Computing, 6:121–139, 1992.Google Scholar
  9. 9.
    O. Maler, Z. Manna, and A. Pnueli. From timed to hybrid systems. In Proc. of the REX Workshop “Real-Time: Theory in Practice”, volume 600 of Lect. Notes in Comp. Sci., pages 447–484. Springer-Verlag, 1992.Google Scholar
  10. 10.
    Z. Manna and A. Pnueli. Completing the temporal picture. Theor. Comp. Sci., 83(1):97–130, 1991.CrossRefGoogle Scholar
  11. 11.
    Z. Manna and A. Pnueli. Models for reactivity. Acta Informatica, 30:609–678, 1993.CrossRefGoogle Scholar
  12. 12.
    S. Safra. On the complexity of ω-automata. In Proc. 29th IEEE Symp. Found. of Comp. Sci., 1988.Google Scholar
  13. 13.
    H.B. Sipma, T.E. Uribe, and Z. Manna. Deductive model checking. In Computer Aided Verification, volume 1102, pages 208–219. Springer-Verlag, 1996.Google Scholar

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Luca de Alfaro
    • 1
  • Arjun Kapur
    • 1
  • Zohar Manna
    • 1
  1. 1.Department of Computer ScienceStanford UniversityUSA

Personalised recommendations