Skip to main content

Time for concurrency

  • II. Symbolic Computation, Programming, and Software Engineering
  • Conference paper
  • First Online:
Future Tendencies in Computer Science, Control and Applied Mathematics (INRIA 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 653))

Included in the following conference series:

Abstract

A hierarchy of models that capture realistic aspects of reactive and real-time systems is introduced. On the most abstract level, the qualitative (non-quantitative) model captures the temporal precedence aspect of time. A more refined model is that of timed transition systems, representing the metric aspects of time. The third and most detailed model is that of hybrid systems. This model allows the incorporation of continuous components into the studied reactive system.

This research was supported in part by the National Science Foundation under grants CCR-89-11512 and CCR-89-13641, by the Defense Advanced Research Projects Agency under contract NAG2-703, by the United States Air Force Office of Scientific Research under contract AFOSR-90-0057, by the European Community ESPRIT Basic Research Action Project 6021 (REACT) and by the France-Israel project for cooperation in Computer Science.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abadi and L. Lamport. An old-fashioned recipe for real time. 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. Springer-Verlag, 1992.

    Google Scholar 

  2. A. Bernstein and P. K. Harter. Proving real time properties of programs with temporal logic. In Proceedings of the Eighth Symposium on Operating Systems Principles, pages 1–11. ACM, 1981.

    Google Scholar 

  3. D. Harel. Statecharts: A visual approach to complex systems. Technical report, Dept. of Applied Mathematics, Weizmann Institute of Science CS84-05, 1984.

    Google Scholar 

  4. D. Harel. Statecharts: A visual formalism for complex systems. Sci. Comp. Prog., 8:231–274, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  5. T.A. Henzinger. Sooner is safer than later. Technical report, Stanford University, 1991.

    Google Scholar 

  6. 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 

  7. T. Henzinger, Z. Manna, and A. Pnueli. An interleaving model for real time. In 5th Jerusalem Conference on Information Technology, pages 717–730, 1990.

    Google Scholar 

  8. 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 

  9. T. Henzinger, Z. Manna, and A. Pnueli. Timed transition 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. Springer-Verlag, 1992.

    Google Scholar 

  10. 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 

  11. R. Koymans. Specifying real-time properties with metric temporal logic. Real-time Systems, 2(4):255–299, 1990.

    Article  Google Scholar 

  12. Y. Kesten and A. Pnueli. Timed and hybrid statecharts and their textual representation. In J. Vytopil, editor, Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 571 of Lect. Notes in Comp. Sci., pages 591–619. Springer-Verlag, 1992.

    Google Scholar 

  13. 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 

  14. 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. Springer-Verlag, 1992.

    Google Scholar 

  15. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, New York, 1991.

    MATH  Google Scholar 

  16. Z. Manna and A. Pnueli. Models for reactive systems. Technical report, Dept. of Comp. Sci., Stanford University, 1992.

    Google Scholar 

  17. P. 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 

  18. 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. Springer-Verlag, 1992.

    Google Scholar 

  19. J.S. Ostroff. Temporal Logic of Real-Time Systems. Advanced Software Development Series. Research Studies Press (John Wiley & Sons), Taunton, England, 1990.

    Google Scholar 

  20. 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, volume 331 of Lect. Notes in Comp. Sci., pages 84–98. Springer-Verlag, 1988.

    Google Scholar 

  21. A. Pnueli. How vital is liveness? In W.R. Cleaveland, editor, Proceedings of Concur'92, volume 630 of Lecture Notes in Computer Science, pages 162–175. Springer-Verlag, 1992.

    Google Scholar 

  22. 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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

A. Bensoussan J. -P. Verjus

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Manna, Z., Pnueli, A. (1992). Time for concurrency. In: Bensoussan, A., Verjus, J.P. (eds) Future Tendencies in Computer Science, Control and Applied Mathematics. INRIA 1992. Lecture Notes in Computer Science, vol 653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56320-2_56

Download citation

  • DOI: https://doi.org/10.1007/3-540-56320-2_56

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56320-4

  • Online ISBN: 978-3-540-47520-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics