Verification of clocked and hybrid systems

  • Yonit Kestent
  • Zohar Manna
  • Amir Pnueli
Formal Model and Analysis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1494)

Abstract

This paper presents a new computational model for realtime systems, called the clocked transition system (CTS) model. The CTS model is a development of our previous timed transition model, where some of the changes are inspired by the model of timed automata. The new model leads to a simpler style of temporal specification and verification, requiring no extension of the temporal language. We present verification rules for proving safety properties (including time-bounded response properties) of clocked transition systems, and separate rules for proving (time-unbounded) response properties. All rules are associated with verification diagrams. The verification of response properties requires adjustments of the proof rules developed for untimed systems, reflecting the fact that progress in the real time systems is ensured by the progress of time and not by fairness. The style of the verification rules is very close to the verification style of untimed systems which allows the (re)use of verification methods and tools, developed for untimed reactive systems, for proving all interesting properties of real-time systems.

We conclude with the presentation of a branching-time based approach for verifying that an arbitrary given CTS is non-zeno.

Finally, we present an extension of the model and the invariance proof rule for hybrid systems.

Keywords

Ranking Function Verification Condition Proof Rule Auxiliary Assertion Master Clock 
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. [AD94]
    R. Alur and D.L. Dill. A theory of timed automata. Theor. Comp. Sci., 126:183–235, 1994.Google Scholar
  2. [AH89]
    R. Alur and T.A. Henzinger. A really temporal logic. In Proc. 30th IEEE Symp. Found. of Comp. Sci., pages 164–169, 1989.Google Scholar
  3. [AH92]
    R. Alur and T. Henzinger. Logics and models of real time: A survey. In J.W. de Bakker, C. Huizing, W.P. de Roever, and G. Rozenberg, editors, Proceedings of the REX Workshop “Real-Time: Theory in Practice”, volume 600 of Lect. Notes in Comp. Sci., pages 74–106. Springer-Verlag, 1992.Google Scholar
  4. [AH94]
    R. Alur and T.A. Henzinger. Real-time system = discrete system + clock variables. In T. Rus and C. Rattray, editors, Theories and Experiences for Real-time System Development, AMAST Series in Computing 2, pages 1–29. World Scientific, 1994.Google Scholar
  5. [AL94]
    M. Abadi and L. Lamport. An old-fashioned recipe for real time. ACM Trans. Prog. Lang. Sys., 16(5):1543–1571, 1994.Google Scholar
  6. [BAMP83]
    M. Ben-Ari, Z. Manna, and A. Pnueli. The temporal logic of branching time. Acta Informatica, 20:207–226, 1983.Google Scholar
  7. [BBC95]
    [BBC+95] N. Bjørner, I.A. Browne, E. Chang, M. Colón, A. Kapur, Z. Manna, H.B. Sipma, and T.E. Uribe. STeP: The Stanford Temporal Prover, User's Manual. Technical Report STAN-CS-TR-95-1562, Computer Science Department, Stanford University, November 1995.Google Scholar
  8. [BMSU97]
    N.S. Biorner, Z. Manna, H.B. Sipma, and T.E. Uribe. Deductive verification of real-time systems using STeP. In 4th Intl. AMAST Workshop on Real-Time Systems, volume 1231 of Lect. Notes in Comp. Sci., pages 22–43. Springer-Verlag, May 1997.Google Scholar
  9. [EC82]
    E.A. Emerson and E.M. Clarke. Using branching time temporal logic to synthesize synchronization skeletons. Sci. Comp. Prog., 2:241–266, 1982.Google Scholar
  10. [FG95]
    L. Fix and O. Grumberg. Verification of temporal properties. to appear in Logic and Computation, 1995.Google Scholar
  11. [Har87]
    D. Harel. Statecharts: A visual formalism for complex systems. Sci. Comp. Prog., 8:231–274, 1987.Google Scholar
  12. [Hen92]
    T.A. Henzinger. Sooner is safer than later. Info. Proc. Lett., 43(3):135–142, 1992.Google Scholar
  13. [HHWT95]
    T.A. Henzinger, P.-H. Ho, and H. Wong-Toi. A user guide to HYTECH. In Proceedings of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Aarhus, Denmark, 1995. To appear.Google Scholar
  14. [HK94]
    T.A. Henzinger and P.W. Kopke. Verification methods for the divergent runs of clock systems. In H. Langmaack, W.-P. de Roever, and J. Vytopil, editors, FTRTFT 94: Formal Techniques in Real-time and Fault-tolerant Systems, Lecture Notes in Computer Science 863, pages 351–372. Springer-Verlag, 1994.Google Scholar
  15. [HMP94]
    T. Henzinger, Z. Manna, and A. Pnueli. Temporal proof methodologies for timed transition systems. Inf. and Comp., 112(2):273–337, 1994.Google Scholar
  16. [KdR85]
    R. Koymans and W.-P. de Roever. Examples of a real-time temporal logic specifications. In B.D. Denvir, W.T. Harwood, M.I. Jackson, and M.J. Wray, editors, The Analysis of Concurrent Systems, volume 207 of Lect. Notes in Comp. Sci., pages 231–252. Springer-Verlag, 1985.Google Scholar
  17. [KMP96]
    Y. Kesten, Z. Manna, and A. Pnueli. Verifying clocked transition systems. In R. Alur, T.A. Henzinger, and E.D. Sontag, editors, Hybrid Systems III, volume 1066 of Lect. Notes in Comp. Sci., pages 13–40. Springer-Verlag, 1996.Google Scholar
  18. [Koy90]
    R. Koymans. Specifying real-time properties with metric temporal logic. Real-time Systems, 2(4):255–299, 1990.Google Scholar
  19. [KVdR83]
    R. Koymans, J. Vytopyl, and W.-P. de Roever. Real-time programming and asynchronous message passing. In Proc. 2nd ACM Symp. Princ. of Dist. Comp., pages 187–197, 1983.Google Scholar
  20. [Lam95]
    L. Lamport. Proving possibiity properties. Technical Report 137, Digital Equipment Corporation, Systems Research Center, Palo Alto, July 1995.Google Scholar
  21. [MMP92]
    O. Maler, Z. Manna, and A. Pnueli. From timed to hybrid systems. In J.W. de Bakker, C. Huizing, W.P. de Roever, and G. Rozenberg, editors, Proceedings 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
  22. [MP91a]
    Z. Manna and A. Pnueli. Completing the temporal picture. Theor. Comp. Sci., 83(1):97–130, 1991.Google Scholar
  23. [MP91b]
    Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, New York, 1991.Google Scholar
  24. [MP93a]
    Z. Manna and A. Pnueli. Models for reactivity. Acta Informatica, 30:609–678, 1993.Google Scholar
  25. [MP93b]
    Z. Manna and A. Pnueli. Verifying hybrid systems. In R.L. Grossman, A. Nerode, A. Ravn, and H. Rischel, editors, Hybrid Systems, volume 736 of Lect. Notes in Comp. Sci., pages 4–35. Springer-Verlag, 1993.Google Scholar
  26. [MP94]
    Z. Manna and A. Pnueli. Temporal verification diagrams. In T. Ito and A. R. Meyer, editors, Theoretical Aspects of Computer Software, volume 789 of Lect. Notes in Comp. Sci., pages 726–765. Springer-Verlag, 1994.Google Scholar
  27. [MP95a]
    Z. Manna and A. Pnueli. Clocked transition systems. In Logic and Software Workshop, August 1995. Beijing, China.Google Scholar
  28. [MP95b]
    Z. Manna and A. Pnueli.Temporal Verification of Reactive Pnueli. Temporal Safety. Springer-Verlag, New York, 1995.Google Scholar
  29. [MT90]
    F. Moller and C. Tofts. A temporal calculus of communicating systems. In J.C.M. Baeten and J.W. Klop, editors, Proceedings of Concur'90, volume 458 of Lect. Notes in Comp. Sci., pages 401–415. Springer-Verlag, 1990.Google Scholar
  30. [NOSY93]
    X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. An approach to the description and analysis of hybrid systems. In R.L. Grossman, A. Nerode, A. Ravn, and H. Rischel, editors, Hybrid Systems, volume 736 of Lect. Notes in Comp. Sci., pages 149–178. Springer-Verlag, 1993.Google Scholar
  31. [NSY92]
    X. Nicollin, J. Sifakis, and S. Yovine. From ATP to timed graphs and hybrid systems. In J.W. de Bakker, C. Huizing, W.P. de Roever, and G. Rozenberg, editors, Proceedings of the REX Workshop “Real-Time: Theory in Practice”, volume 600 of Lect. Notes in Comp. Sci., pages 549–572. Springer-Verlag, 1992.Google Scholar
  32. [Ost90]
    J.S. Ostroff. Temporal Logic of Real-Time Systems. Advanced Software Development Series. Research Studies Press (John Wiley & Sons), Taunton, England, 1990.Google Scholar
  33. [SBM92]
    F. B. Schneider, B. Bloom, and K. Marzullo. Putting time into proof outlines. In J.W. de Bakker, C. Huizing, W.P. de Roever, and G. Rozenberg, editors, Proceedings of the REX Workshop “Real-Time: Theory in Practice”, volume 600 of Lect. Notes in Comp. Sci., pages 618–39. Springer-Verlag, 1992.Google Scholar
  34. [Sif91]
    J. Sifakis. An overview and synthesis on timed process algebra. In K.G. Larsen and A. Skou, editors, 3rd Computer Aided Verification Workshop, volume 575 of Lect. Notes in Comp. Sci., pages 376–398. Springer-Verlag, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Yonit Kestent
    • 1
  • Zohar Manna
    • 2
  • Amir Pnueli
    • 1
  1. 1.Department of Computer ScienceWeizmann InstituteRehovotIsrael
  2. 2.Department of Computer ScienceStanford UniversityStanford

Personalised recommendations