Advertisement

Towards refining temporal specifications into hybrid systems

  • Thomas A. Henzinger
  • Zohar Manna
  • Amir Pnueli
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 736)

Abstract

We propose a formal framework for designing hybrid systems by stepwise refinement. Starting with a specification in hybrid temporal logic, we make successively more transitions explicit until we obtain an executable system.

Keywords

Atomic Formula Phase Sequence Environment Transition State Formula Left Limit 
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. [AL90]
    M. Abadi and L. Lamport. Composing specifications. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Stepwise Refinement of Distributed Systems, Lecture Notes in Computer Science 430. Springer-Verlag, 1990.Google Scholar
  2. [AH92]
    R. Alur and T.A. Henzinger. Logics and models of real time: a survey. In J.W. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, editors, Real Time: Theory in Practice, Lecture Notes in Computer Science 600, pages 74–106. Springer-Verlag, 1992.Google Scholar
  3. [CHR92]
    Z. Chaochen, C.A.R. Hoare, and A.P. Ravn. A calculus of durations. Information Processing Letters, 40:269–276, 1992.Google Scholar
  4. [Hen92]
    T.A. Henzinger. Sooner is safer than later. Information Processing Letters, 43:135–141, 1992.Google Scholar
  5. [HMP92]
    T.A. Henzinger, Z. Manna, and A. Pnueli. Timed transition systems. In J.W. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, editors, Real Time: Theory in Practice, Lecture Notes in Computer Science 600, pages 226–251. Springer-Verlag, 1992.Google Scholar
  6. [HNSY92]
    T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. In Proceedings of the Seventh Annual Symposium on Logic in Computer Science, pages 394–406. IEEE Computer Society Press, 1992.Google Scholar
  7. [LA92]
    L. Lamport and M. Abadi. An old-fashioned recipe for real time. In J.W. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, editors, Real Time: Theory in Practice, Lecture Notes in Computer Science 600, pages 1–27. Springer-Verlag, 1992.Google Scholar
  8. [MMP92]
    O. Maler, Z. Manna, and A. Pnueli. From timed to hybrid systems. In J.W. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, editors, Real Time: Theory in Practice, Lecture Notes in Computer Science 600, pages 447–484. Springer-Verlag, 1992.Google Scholar
  9. [Mos85]
    B. Moszkowski. A temporal logic for multi-level reasoning about hardware. IEEE Computer, 18(2):10–19, 1985.Google Scholar
  10. [NSY92]
    X. Nicollin, J. Sifakis, and S. Yovine. From ATP to timed graphs and hybrid systems. In J.W. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, editors, Real Time: Theory in Practice, Lecture Notes in Computer Science 600, pages 549–572. Springer-Verlag, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Thomas A. Henzinger
    • 1
  • Zohar Manna
    • 2
  • Amir Pnueli
    • 3
  1. 1.Department of Computer ScienceCornell UniversityIthaca
  2. 2.Department of Computer ScienceStanford UniversityStanford
  3. 3.Department of Applied MathematicsThe Weizmann Institute of ScienceRehovotIsrael

Personalised recommendations