Skip to main content
SpringerLink
Log in

Timed transition systems

  • Conference paper
  • First Online:
Real-Time: Theory in Practice (REX 1991)

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

Abstract

We incorporate time into an interleaving model of concurrency. In timed transition systems, the qualitative fairness requirements of traditional transition system are replaced (and superseded) by quantitative lower-bound and upperbound timing constraints on transitions. The purpose of this paper is to explore the scope of applicability for the abstract model of timed transition systems. We demonstrate that the model can represent a wide variety of phenomena that routinely occur in conjunction with the timed execution of concurrent processes. Our treatment covers both processes that are executed in parallel on separate processors and communicate either through shared variables or by message passing, and processes that time-share a limited number of processors under a given scheduling policy. Often it is this scheduling policy that determines if a system meets its real-time requirements. Thus we explicitly address such questions as time-outs, interrupts, static and dynamic priorities.

This research was supported in part by an IBM graduate fellowship, by the National Science Foundation grants CCR-89-11512 and CCR-89-13641, by the Defense Advanced Research Projects Agency under contract N00039-84-C-0211, by the United States Air Force Office of Scientific Research under contract AFOSR-90-0057, and by the European Community ESPRIT Basic Research Action project 3096 (SPEC).

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K.R. Apt, N. Francez, and S. Katz. Appraising fairness in languages for distributed programming. Distributed Computing, 2(4):226–241, 1988.

    Article  Google Scholar 

  2. R. Alur and T.A. Henzinger. A really temporal logic. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pages 164–169. IEEE Computer Society Press, 1989.

    Google Scholar 

  3. R. Alur and T.A. Henzinger. Real-time logics: complexity and expressiveness. In Proceedings of the Fifth Annual Symposium on Logic in Computer Science, pages 390–401. IEEE Computer Society Press, 1990.

    Google Scholar 

  4. M. Abadi and L. Lamport. The existence of refinement mappings. In Proceedings of the Third Annual Symposium on Logic in Computer Science, pages 165–175. IEEE Computer Society Press, 1988.

    Google Scholar 

  5. H. Barringer, R. Kuiper, and A. Pnueli. A really abstract concurrent model and its temporal logic. In Proceedings of the 13th Annual Symposium on Principles of Programming Languages, pages 173–183. ACM Press, 1986.

    Google Scholar 

  6. E. Harel. Temporal analysis of real-time systems. Master's thesis, The Weizmann Institute of Science, Rehovot, Israel, 1988.

    Google Scholar 

  7. T.A. Henzinger. Half-order modal logic: how to prove real-time properties. In Proceedings of the Ninth Annual Symposium on Principles of Distributed Computing, pages 281–296. ACM Press, 1990.

    Google Scholar 

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

    Google Scholar 

  9. T.A. Henzinger. The Temporal Specification and Verification of Real-time Systems. PhD thesis, Stanford University, 1991.

    Google Scholar 

  10. E. Harel, O. Lichtenstein, and A. Pnueli. Explicit-clock temporal logic. In Proceedings of the Fifth Annual Symposium on Logic in Computer Science, pages 402–413. IEEE Computer Society Press, 1990.

    Google Scholar 

  11. T.A. Henzinger, Z. Manna, and A. Pnueli. An interleaving model for real time. In Proceedings of the Fifth Jerusalem Conference on Information Technology, pages 717–730. IEEE Computer Society Press, 1990.

    Google Scholar 

  12. T.A. Henzinger, Z. Manna, and A. Pnueli. Temporal proof methodologies for real-time systems. In Proceedings of the 18th Annual Symposium on Principles of Programming Languages, pages 353–366. ACM Press, 1991.

    Google Scholar 

  13. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.

    Google Scholar 

  14. D.N. Jayasimha. Communication and Synchronization in Parallel Computation. PhD thesis, University of Illinois at Urbana-Champaign, 1988.

    Google Scholar 

  15. R.M. Keller. Formal verification of parallel programs. Communications of the ACM, 19(7):371–384, 1976.

    Article  Google Scholar 

  16. [KSdR+88] R. Koymans, R.K. Shyamasundar, W.-P. de Roever, R. Gerth, and S. Arun-Kumar. Compositional semantics for real-time distributed computing. Information and Computation, 79(3):210–256, 1988.

    Article  Google Scholar 

  17. L. Lamport and M. Abadi. Refining and composing real-time specifications. This volume.

    Google Scholar 

  18. L. Lamport. What good is temporal logic? In R.E.A. Mason, editor, Information Processing 83: Proceedings of the Ninth IFIP World Computer Congress, pages 657–668. Elsevier Science Publishers (North-Holland), 1983.

    Google Scholar 

  19. 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, Lecture Notes in Computer Science 354, pages 201–284. Springer-Verlag, 1989.

    Google Scholar 

  20. J.S. Ostroff. Temporal Logic of Real-time Systems. Research Studies Press, 1990.

    Google Scholar 

  21. 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, Lecture Notes in Computer Science 331, pages 84–98. Springer-Verlag, 1988.

    Google Scholar 

  22. A. Pnueli. The temporal logic of programs. In Proceedings of the 18th Annual Symposium on Foundations of Computer Science, pages 46–57. IEEE Computer Society Press, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Cornell University, 14853, Ithaca, NY, USA

    Thomas A. Henzinger

  2. Computer Science Department, Stanford University, 94305, Stanford, CA, USA

    Zohar Manna

  3. Department of Applied Mathematics, Weizmann Institute of Science, 76100, Rehovot, Israel

    Zohar Manna

  4. Department of Applied Mathematics, Weizmann Institute of Science, 76100, Rehovot, Israel

    Amir Pnueli

Authors
  1. Thomas A. Henzinger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zohar Manna
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Amir Pnueli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. W. de Bakker C. Huizing W. P. de Roever G. Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Henzinger, T.A., Manna, Z., Pnueli, A. (1992). Timed transition systems. In: de Bakker, J.W., Huizing, C., de Roever, W.P., Rozenberg, G. (eds) Real-Time: Theory in Practice. REX 1991. Lecture Notes in Computer Science, vol 600. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031995

Download citation

  • DOI: https://doi.org/10.1007/BFb0031995

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55564-3

  • Online ISBN: 978-3-540-47218-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation