# Timed transition systems

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

## Keywords

Transition systems concurrency real time## Preview

Unable to display preview. Download preview PDF.

## References

- [AFK88]K.R. Apt, N. Francez, and S. Katz. Appraising fairness in languages for distributed programming.
*Distributed Computing*, 2(4):226–241, 1988.CrossRefGoogle Scholar - [AH89]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 - [AH90]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 - [AL88]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 - [BKP86]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 - [Har88]E. Harel. Temporal analysis of real-time systems. Master's thesis, The Weizmann Institute of Science, Rehovot, Israel, 1988.Google Scholar
- [Hen90]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 - [Hen91a]T.A. Henzinger. Sooner is safer than later. Technical report, Stanford University, 1991.Google Scholar
- [Hen91b]T.A. Henzinger.
*The Temporal Specification and Verification of Real-time Systems*. PhD thesis, Stanford University, 1991.Google Scholar - [HLP90]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 - [HMP90]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 - [HMP91]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 - [Hoa85]C.A.R. Hoare.
*Communicating Sequential Processes*. Prentice-Hall, 1985.Google Scholar - [Jay88]D.N. Jayasimha.
*Communication and Synchronization in Parallel Computation*. PhD thesis, University of Illinois at Urbana-Champaign, 1988.Google Scholar - [Kel76]R.M. Keller. Formal verification of parallel programs.
*Communications of the ACM*, 19(7):371–384, 1976.CrossRefGoogle Scholar - [KSdR+88][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.CrossRefGoogle Scholar - [LA]L. Lamport and M. Abadi. Refining and composing real-time specifications. This volume.Google Scholar
- [Lam83]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 - [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*, Lecture Notes in Computer Science 354, pages 201–284. Springer-Verlag, 1989.Google Scholar - [Ost90]J.S. Ostroff.
*Temporal Logic of Real-time Systems*. Research Studies Press, 1990.Google Scholar - [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*, Lecture Notes in Computer Science 331, pages 84–98. Springer-Verlag, 1988.Google Scholar - [Pnu77]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