Abstract
Hard real time systems need schedulability analysis to check that timing constraints are met before the actual application is run. In the literature, schedulability analysis is tackled by assuming that the real-time system is described by concurrent processes. However, high level Petri nets, such as those used in Protob, provide a more conceptual representation than concurrent processes.
This paper illustrates the computation of schedules of activities from Protob nets with different execution policies (one processor without preemption, one processor with preemption) and the translation of such schedules into concurrent processes for which optimal scheduling algorithms, such as [1], exist.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J. Xu and D.L. Parnas. Scheduling processes with release times, deadlines, precedence, and exclusion relations. IEEE Transactions on Software Engineering, vol. 16, March 1990.
A.D. Stoyenko, V.C. Hamacher, and R.C. Holt. Analyzing hard-real-time programs for guaranteed schedulability. IEEE Transactions on Software Engineering, vol. 17, August 1991.
M. Baldassari and G. Bruno. PROTOB: an object oriented methodology for developing discrete event dynamic systems. Comp. Lang., vol. 16, January 1991.
C. Ramachandani. Analysis of Asynchronous Concurrent Systems by Timed Petri Nets. PhD thesis, Massachussets Inst. Technol., 1974.
P. Merlin and D.J. Faber. Recoverability of communications protocols. IEEE Trans. Comm., vol. 24, September 1976.
B. Berthomieu and M. Diaz. Modeling and verification of time dependent systems using time Petri nets. IEEE Transactions on Software Engineering, vol. 17, March 1991.
R.S. Chin and S.T. Chanson. Distributed object-based programming systems. Computing Surveys, vol. 23, March 1991.
M. Baldassari and G. Bruno. A methodology and environment for the object oriented analysis and design of real time systems. In EUROMICRO'90 workshop on real time, 1990.
K.B. Kenny and K.-J. Lin. Measuring and analyzing real-time performance. IEEE Software, September 1991.
G. Bruno, A. Castella, and M.P. Pescarmona. Object-driven process scheduling of hard real time systems. Technical Report 69/91, Dip. Automatica e Informatica, Politecnico di Torino, Torino, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bruno, G., Castella, A., Macario, G., Pescarmona, M.P. (1992). Scheduling hard real time systems using high-level Petri nets. In: Jensen, K. (eds) Application and Theory of Petri Nets 1992. ICATPN 1992. Lecture Notes in Computer Science, vol 616. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55676-1_6
Download citation
DOI: https://doi.org/10.1007/3-540-55676-1_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55676-3
Online ISBN: 978-3-540-47270-4
eBook Packages: Springer Book Archive