Scheduling hard real time systems using high-level Petri nets

  • Giorgio Bruno
  • Andrea Castella
  • Gianpaolo Macario
  • Marco P. Pescarmona
Submitted Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 616)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    M. Baldassari and G. Bruno. PROTOB: an object oriented methodology for developing discrete event dynamic systems. Comp. Lang., vol. 16, January 1991.Google Scholar
  4. 4.
    C. Ramachandani. Analysis of Asynchronous Concurrent Systems by Timed Petri Nets. PhD thesis, Massachussets Inst. Technol., 1974.Google Scholar
  5. 5.
    P. Merlin and D.J. Faber. Recoverability of communications protocols. IEEE Trans. Comm., vol. 24, September 1976.Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    R.S. Chin and S.T. Chanson. Distributed object-based programming systems. Computing Surveys, vol. 23, March 1991.Google Scholar
  8. 8.
    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.Google Scholar
  9. 9.
    K.B. Kenny and K.-J. Lin. Measuring and analyzing real-time performance. IEEE Software, September 1991.Google Scholar
  10. 10.
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Giorgio Bruno
    • 1
  • Andrea Castella
    • 1
  • Gianpaolo Macario
    • 1
  • Marco P. Pescarmona
    • 1
  1. 1.Dipartimento di Automatica e InformaticaPolitecnico di TorinoTorinoItaly

Personalised recommendations