Abstract
We present an off-line methodology of analysis of real-time systems, composed of periodic, precedence and resource constrained real-time tasks. As there is no polynomial optimal scheduling technique for such tasks sets, we present an enumerative method based on the construction of the state graph of a Petri net. The time is modeled by the Petri net through the earliest firing rule.
This is a preview of subscription content, log in via an institution to check access.
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
K. R. Baker and Z. S. Su, Sequencing with due-dates and early start times to minimize maximum tardiness, Naval Research Logistic Quarterly, 21 (1974), pp. 171–176.
P. Bratley, M. Florian and P. Robillard, Scheduling with earliest start and due date constraints on multiple machines, Naval Research Logistic Quarterly, 22 (1975), pp. 165–173.
A. Choquet-Geniet, F. Cottet and D. Geniet, Exhaustive computation of the scheduled task execution sequences of a real-time application, FTRTFP, Lecture Notes in Computer Science, 1135 (1996).
E. Grolleau, Ordonnancement temps réel hors-ligne optimal à l’aide de réseaux de Petri en environnement monoprocesseur et multiprocesseur, Universite de Poitiers-ENSMA, 1999, pp. 235.
J. Leung and M. Merrill, A note on preemptive scheduling of periodic real-time tasks, Information Processing Letters, 11 (1980), pp. 115–118.
C. L. Liu and J. W. Layland, Scheduling algorithms for multiprogramming in realtime environment, Journal of the ACM, 20 (1973), pp. 46–61.
A. K. Mok, Fundamental design problems of distributed systems for the hard realtime environment, Department of Electrical Engineering and Computer Science, Massachussets Institute of Technologic Cambridge, 1983.
J. A. Stankovic, M. Spuri, M. D. Natale and G. Buttazzo, Implications of classical scheduling results fo real-time systems, IEEE Computer, 28 (1995), pp. 1–24.
P. H. Starke, Some properties of timed nets under the earliest firing rule, Advances in Petri nets 1989, Venice in Lecture Notes in Computer Science, 424 (1990), pp. 418–432.
J. Xu and D. Parnas, Scheduling processes with release times, deadlines, precedence, and exclusion relations, IEEE Transactions on Software Engineering, 16(1990), pp. 360–369.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Grolleau, E., Choquet-Geniet, A. (2000). Off-Line Computation of Real-Time Schedules by Means of Petri nets. In: Boel, R., Stremersch, G. (eds) Discrete Event Systems. The Springer International Series in Engineering and Computer Science, vol 569. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4493-7_32
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4493-7_32
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7025-3
Online ISBN: 978-1-4615-4493-7
eBook Packages: Springer Book Archive