In: Jensen, K.: Lecture Notes in Computer Science, Vol. 616; 13th International Conference on Application and Theory of Petri Nets 1992, Sheffield, UK, pages 93-112. Springer-Verlag, June 1992.
Abstract: Hart 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 exist.