Abstract
Recently, real-time system models have been proposed which fall into the general category of timed automata. A timed automaton consists of a discrete event component represented as a finite automaton, coupled with a temporal component represented as a finite collection of clocks marking time between event occurrences. For timed automata it is possible to reduce certain verification problems to those of checking language containment or language emptiness. We extend this model to allow the clocks to rim at rates other than one. The extension is well suited to the analysis of scheduling problems, find we demonstrate this by the modeling a simple scheduling policy. We give conditions for reduction of the rate automaton to a finite state automaton.
Research supported by National Science Foundation under grants ECSl 11907 and IRI9120074.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Alur, C. Courcoubetis, AND D. Dill, Model-checking for real-time systems, in IEEE Proceedings of the Fifth Annual Symposium on Logic and Computer Science, 1990.
R. Alur, C. Courcoubetis, T. Henzinger, AND P. Ho, Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems (preprint ) 1993.
R. Alur AND D. Dill, Automata for modeling real-time systems, in Proceedings of the 17th Annual Colloquium on Automata, Languages, and Programming, 1990.
S. Baruah, A. Mok, AND L. Rosier, Preemptively scheduling hard-real-time sporadic tasks on one processor, Real-Time Systems Symposium, 1990.
M. Dertouzos, Control robotics; the procedural control of physical processes, in Proceedings of the IFIP Congress, 1974.
D. Dill, Timing assumptions and verification of finite-state concurrent systems, in Automatic Verification Methods for Finite State Systems, Lecture Notes in Computer Science, no. 407 Springer-Verlag 1989.
A. Fawaz, P. Varaiya, AND J. Walrand, Analysis of interrupt handling schemes in real-time systems, in Proceedings of the International Phoenix Conference on Computers and Communication, 1989, pp. 260–263.
K. Jeffay, D. Stanat, AND C. Martel, On non-preemptive scheduling of periodic and sporadic tasks, Real-Time Systems Symposium, 1991.
Y. Kelly, A. Pnueli, J. Sifakis, AND S.Yovine, Integration graphs: a class of decidable hybrid systems, (preprint) 1993.
J. McManis, Control of Real-Time Discrete Events Dynamical Systems, ( PhD thesis) University of California, Berkeley 1993.
F. Modugno, M. Merritt, AND M. Tuttle, Time constrained automata, in CONCUR’91 Proceedings, Workshop on Theories of Concurrency: Unification and Extension, LNCS 527, Springer-Verlag, August 1991, pp. 408 – 423.
S. Narain, Proving temporal properties about hybrid systems, RAND Corporation, 1990.
X. Nicollin, A. Olivero, J. Sifakis, AND S. Yovine, An approach to the description and analysis of hybrid systems, in Proceedings of the Workshop on Theory of Hybrid Systems, Lyngby, Denmark, Lecture Notes in Computer Science, Springer-Verlag 1992.
X. Nicollin, J. Sifakis, AND S. Yovine, From atp to timed graphs and hybrid systems, in Real Time: Theory in Practice, (J. W. de Bakker, K. Huising, W.-P. de Roever, AND G. Rozenberg, editors) Lecture Notes in Computer Science, Springer-Verlag, 1992.
J. Ostroff, Temporal Logic for Real-Time Systems, Research Studies Press Ltd. 1989.
B. Sprunt, L. Sha, AND J. Lehoczky, A periodic task scheduling for hard-real-time systems, in The Journal of Real-Time Systems, 1989.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag New York, Inc
About this paper
Cite this paper
McManis, J., Varaiya, P. (1995). Modeling Real-Time Systems using Rate Automata. In: Kumar, P.R., Varaiya, P.P. (eds) Discrete Event Systems, Manufacturing Systems, and Communication Networks. The IMA Volumes in Mathematics and its Applications, vol 73. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9347-4_7
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9347-4_7
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-9349-8
Online ISBN: 978-1-4613-9347-4
eBook Packages: Springer Book Archive