Advertisement

Prom timed to hybrid systems

  • Oded Maler
  • Zohar Manna
  • Amir Pnueli
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 600)

Abstract

We propose a framework for the formal specification and verification of timed and hybrid systems. For timed systems we propose a specification language that refers to time only through age functions which measure the length of the most recent time interval in which a given formula has been continuously true.

We then consider hybrid systems, which are systems consisting of a non-trivial mixture of discrete and continuous components, such as a digital controller that controls a continuous environment. The proposed framework extends the temporal logic approach which has proven useful for the formal analysis of discrete systems such as reactive programs. The new framework consists of a semantic model for hybrid time, the notion of phase transition systems, which extends the formalism of discrete transition systems, an extended version of Statecharts for the specification of hybrid behaviors, and an extended version of temporal logic that enables reasoning about continuous change.

Keywords

Real-time timed transitions system hybrid systems discrete and continuous systems Statecharts 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ACD90]
    R. Alur, C. Courcoubetis, and D.L. Dill. Model checking for real-time systems. In Proceedings of the Fifth Annual Symposium on Logic in Computer Science, pages 414–425. IEEE Computer Society Press, 1990.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. [AH90]
    R. Alur and T.A. Henzinger. Real-time logics: Complexity and expressiveness. In Proc. 5th IEEE Symp. Logic in Comp. Sci., 1990.Google Scholar
  4. [AL91]
    M. Abadi and L. Lamport. An old-fashioned recipe for real time. In Real-Time: Theory in Practice. Lec. Notes in Comp. Sci., Springer-Verlag, 1991. This volume.Google Scholar
  5. [CHR92]
    Z. Chaochen, C.A.R. Hoare, and A.P. Ravn. A calculus of durations. Information Processing Letters, 40(5):269–276, 1992.CrossRefGoogle Scholar
  6. [EC82]
    E.A. Emerson and E.M. Clarke. Using branching time temporal logic to synthesize synchronization skeletons. Sci. Comp. Prog., 2:241–266, 1982.CrossRefGoogle Scholar
  7. [Har84]
    D. Harel. Statecharts: A visual approach to complex systems. Technical report, Dept. of Applied Mathematics, Weizmann Institute of Science CS84-05, 1984.Google Scholar
  8. [Har87]
    D. Harel. Statecharts: A visual formalism for complex systems. Sci. Comp. Prog., 8:231–274, 1987.CrossRefGoogle Scholar
  9. [HLP90]
    E. Harel, O. Lichtenstein, and A. Pnueli. Explicit clock temporal logic. In Proc. 5th IEEE Symp. Logic in Comp. Sci., pages 402–413, 1990.Google Scholar
  10. [HMP91]
    T. Henzinger, Z. Manna, and A. Pnueli. Temporal proof methodologies for real-time systems. In Proc. 18th ACM Symp. Princ. of Prog. Lang., pages 353–366, 1991.Google Scholar
  11. [HRR91]
    K.M. Hansen, A.P. Ravn, and H. Rischel. Specifying and verifying requirements of real-time systems. Proc. ACM SIGSOFT'91 Conf. on Software for Critical Systems, 15(5):44–54, 1991.Google Scholar
  12. [KKZ87]
    R. Koymans, R. Kuiper, and E. Zijlstra. Specifying message passing and real-time systems with real-time temporal logic. In Esprit 87 Results and Achievements. North-Holland, 1987.Google Scholar
  13. [KP92]
    Y. Kesten and A. Pnueli. Timed and hybrid statecharts and their textual representation. In Formal Techniques in Real-Time and Fault-Tolerant Systems. Lec. Notes in Comp. Sci., Springer-Verlag, 1992. Proceedings of a Symposium, Nijmegen.Google Scholar
  14. [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
  15. [Lam83]
    L. Lamport. What good is temporal logic. In R.E.A. Mason, editor, Proc. IFIP 9th World Congress, pages 657–668. North-Holland, 1983.Google Scholar
  16. [MP81]
    Z. Manna and A. Pnueli. Verification of concurrent programs: The temporal framework. In R.S. Boyer and J.S. Moore, editors, The Correctness Problem in Computer Science, pages 215–273. Academic Press, London, 1981.Google Scholar
  17. [MP89]
    Z. Manna and A. Pnueli. The anchored version of the temporal framework. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, pages 201–284. Lec. Notes in Comp. Sci. 354, Springer-Verlag, 1989.Google Scholar
  18. [MP91]
    Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specificaion. Springer Verlag, New York, 1991.Google Scholar
  19. [MSB91]
    K. Marzullo, F.B. Schneider, and N. Budhiraja. Derivation of sequential, real-time, process-control programs. Technical report, Cornell University, 1991. To appear in: Foundations of Real-Time Computing: Formal Specifications and Methods.Google Scholar
  20. [NRSV90]
    X. Nicollin, J.-L. Richier, J. Sifakis, and J. Voiron. ATP: an algebra for timed processes. In Proc. IFIP Working Conference on Formal Description of Programming Concepts, Tiberias, Israel. North-Holland, 1990.Google Scholar
  21. [NSY91]
    X. Nicollin, J. Sifakis, and S. Yovine. From ATP to timed graphs and hybrid systems. In Real-Time: Theory in Practice. Lec. Notes in Comp. Sci., Springer-Verlag, 1991. This volume.Google Scholar
  22. [Ost89]
    J.S. Ostroff. Temporal Logic for Real-Time Systems. Advanced Software Development Series. Research Studies Press (John Wiley & Sons), Taunton, England, 1989.Google Scholar
  23. [PH88]
    A. Pnueli and E. Harel. Applications of temporal logic to the specification of real time systems. In M. Joseph, editor, Formal Techniques in Real-Time and Fault-Tolerant Systems, pages 84–98. Lec. Notes in Comp. Sci. 331, Springer-Verlag, 1988.Google Scholar
  24. [Pnu86]
    A. Pnueli. Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Current Trends in Concurrency, pages 510–584. Lec. Notes in Comp. Sci. 224, Springer-Verlag, 1986.Google Scholar
  25. [PS91]
    A. Pnueli and M. Shalev. What is in a step: On the semantics of statecharts. In T. Ito and A. R. Meyer, editors, Theoretical Aspects of Computer Software, pages 244–264. Lec. Notes in Comp. Sci. 526, Springer-Verlag, 1991.Google Scholar
  26. [RR87]
    G.M. Reed and V.W. Roscoe. Metric spaces as models for real-time concurrency. In Mathematical Foundations of Programming, pages 331–343. Lec. Notes in Comp. Sci. 298, Springer-Verlag, 1987.Google Scholar
  27. [San89]
    E. Sandewall. Combining logic and differential equations for describing real-world systems. In R. J. Brachman, H.J. Levesque, and R. Reiter, editors, Principles of Knowledge Representation and Reasoning, pages 412–420. Morgan Kaufmann, 1989.Google Scholar
  28. [SBM91]
    F. B. Schneider, B. Bloom, and K. Marzullo. Putting time into proof outlines. In Real-Time: Theory in Practice. Lec. Notes in Comp. Sci., Springer-Verlag, 1991. This volume.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Oded Maler
    • 1
  • Zohar Manna
    • 1
    • 2
  • Amir Pnueli
    • 3
  1. 1.INRIA/IRISARennesFrance
  2. 2.Department of Computer ScienceStanford UniversityStanford
  3. 3.Department of Applied MathematicsWeizmann InstituteRehovotIsrael

Personalised recommendations