The Community for Technology Leaders
Proceedings of the Fourth International Workshop on Petri Nets and Performance Models (1991)
Melbourne, Victoria, Australia
Dec. 2, 1991 to Dec. 5, 1991
ISBN: 0-8186-2285-7
pp: 210-215
K. Onaga , Dept. of Circuits & Syst., Hiroshima Univ., Japan
ABSTRACT
Introduces a Petri net based perspective to periodic schedules. These are classified, according to the time interpretation in multiple-server semantics and/or transitions firing periodicity constraints, into strict and general periodic schedules. Using a net transformation rule, the computation of the general schedule class can be done through techniques for the strict subclass. A necessary and sufficient condition for the feasibility of a strict periodic schedule is given. Estimating the truncation error at initial firing time epoch tau /sub 1/ allows to get linear systems of inequalities as necessary conditions for a schedule to be feasible. An linear programming (LP) based heuristic approach is proposed to deal with the computation of 'optimum' (i.e. minimal time) strict periodic schedules under the single-server semantics.<>
INDEX TERMS
Petri nets, scheduling
CITATION

K. Onaga, M. Silva and T. Watanabe, "On periodic schedules for deterministically timed Petri net systems," Proceedings of the Fourth International Workshop on Petri Nets and Performance Models(PNPM), Melbourne, Victoria, Australia, , pp. 210-215.
doi:10.1109/PNPM.1991.238799
93 ms
(Ver 3.3 (11022016))