Real-time system = discrete system + clock variables (1993) [22 citations — 8 self]
Abstract:
How can we take a programming language off the shelf and upgrade it into a real-time programming language? Programs such as device drivers and plant controllers must explicitly refer and react to time. For this purpose, a variety of language constructs---including delays, timeouts, and watchdogs---has been put forward. We advocate an alternative answer, namely, to designate certain program variables as clock variables. The value of a clock variable changes as time advances. Timing constraints can be expressed, then, by conditions on clock values. A single new language construct---the guarded wait statement---suffices to enforce the timely progress of a program. Our presentation proceeds in two steps. First we extend untimed systems (Section 1) with clock variables (Section 2); then we introduce the guarded wait statement (Section 3). The usage of clock variables and the guarded wait statement is illustrated with real-time applications such as round-robin (timeoutdriven) scheduling, priority (interrupt-driven) scheduling, and embedded process control (Section 4). Indeed, clock variables generalize naturally to variables that measure environment parameters other than time (Section 5). In keeping with an expository style, all references are clustered in bibliographic remarks at the end of each section. We conclude by pointing to selected literature on formal methods and support tools for our approach to real-time programming (Section 6). The appendix by Peter W. Kopke presents proof rules for verifying temporal properties of programs with clock variables.
Citations
| 1393 | A theory of timed automata – Alur, Dill - 1994 |
| 449 | The algorithmic analysis of hybrid systems – Alur, Courcoubetis, et al. - 1995 |
| 325 | Model-checking for real-time systems – Alur, Courcoubetis, et al. - 1990 |
| 97 | Model checking in dense real time – Alur, Courcoubetis, et al. - 1993 |
| 41 | A determinizable class of timed automata – Alur, Fix, et al. |
| 28 | Data-Structures for the Verification of Timed Automata – Asarin, Bozga, et al. - 1997 |
| 16 | Safety Without Stuttering – Alpern, Demers, et al. - 1986 |
| 4 | Data structures for the veri cation of timed automata – Asarin, Bozga, et al. - 1997 |

