Chapter

Real-Time: Theory in Practice

Volume 600 of the series Lecture Notes in Computer Science pp 226-251

Date:

Timed transition systems

  • Thomas A. HenzingerAffiliated withComputer Science Department, Cornell University
  • , Zohar MannaAffiliated withComputer Science Department, Stanford UniversityDepartment of Applied Mathematics, Weizmann Institute of Science
  • , Amir PnueliAffiliated withDepartment of Applied Mathematics, Weizmann Institute of Science

* Final gross prices may vary according to local VAT.

Get Access

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