Generic method for automatically generating finite-state machines for schedudling from print engine capabilities

A system for analyzing printing machine capabilities for generating finite-state machines for print engine scheduling wherein,

• each of i.sub.1, . . . , i.sub.n represent a signal, wherein n is a positive integer signal index,
• each of j.sub.1, . . . , j.sub.m represent a capability, wherein m is a positive integer capability index,
• t.sub.n defines one of a plurality of intervals,
• an end interval of capability j is t.sup.j.sub.out defined as <s.sup.j.sub.out, d.sup.j.sub.out >
• provided at an output port of the print engine, and
• in each capability there are n ordered signals S.sub.i.sup.j equals:
• S.sub.i (j)=›t.sub.1 (i,j), . . . , t.sub.n(i,j) (i,j)!;
• the system comprising:
• analysis means for analyzing a plurality of print engine component capabilities, the analysis means including,
• instantiating means for instantiating each capability end to zero by
• .A-inverted.j=1, . . . , m:s.sup.j.sub.out =0,
• signal normalization means for normalizing each signal according to ##EQU2## reach-back means for defining a reach-back value as a distance between a maximum start of a most recent interval associated with each signal and a minimum start of that signal's first interval according to
• .A-inverted.i=1, . . . , n:r.sub.i =max.sub.j=1, . . . m(-(s.sub.1.sup.ij -u.sub.i))
• increment means for determining a minimum increment as a greatest common denominator of at least all interval starts and durations of instantiated capabilities,
• period identification means for identifying a period defined from restricted intervals relative to a selected clock value and
• extension means for defining a bound value in accordance with a maximum reach-back value and a period;
• obtaining means for obtaining component capability parameters of the plurality of print engine component capabilities based on the analysis of the plurality of print engine component capabilities;
• finite-state generating means for generating finite-state machines based on the obtained component capability parameters;
• and,
• scheduling means for scheduling a print engine using the generated finite-state machines.

A system for scheduling a machine using finite-state machines comprising:

• means for receiving a plurality of machine component capabilities, each component capability being defined by a component capability data set;
• derivation means for deriving signal data and timing constraint data from each data set, wherein
• signal data, defining a signal, is formed as a sequence of non-overlapping events on a corresponding machine component, an event being an action of the corresponding machine component associated with a time interval for completing an operation, and
• timing constraint data is defined as one of unary and binary interval constraints on the corresponding machine component;
• analysis means for analyzing the plurality of machine component capabilities in accordance with the defined data set, signal data and timing constraint data, the analysis means including,
• instantiation means for instantiating each of the plurality of machine component capability data sets to zero,
• signal normalization means for normalizing each signal,
• reach-back means for defining a reach-back value as a distance between a maximum start of a most recent interval associated with each signal and a minimum start of that signal's first interval,
• increment means for determining a minimum increment in accordance with timing constraint data of each data set,
• period identification means for identifying a period defined from restricted intervals relative to a selected clock value, and
• extension means for defining a bound value in accordance with a maximum reach-back value and a period;
• obtaining means for obtaining component capability parameters of the plurality of machine component capabilities based on the analysis of the plurality of machine component capabilities;
• finite-state machine generating means for generating finite-state machines based on the obtained component capability parameters;
• and,
• scheduling means for scheduling a machine using the generated finite-state machines.

A method for scheduling a print engine using finite-state machines, the method comprising:

• receiving a plurality of print engine component capabilities, each component capability being defined by a component capability data set;
• deriving signal data and timing constraint data from each data set, wherein
• signal data, defining a signal, is formed as a sequence of non-overlapping events on a corresponding print engine component, an event being an action of the corresponding print engine component associated with a time interval for completing an operation, and
• timing constraint data is defined as one of unary and binary interval constraints on the corresponding print engine component;
• analyzing the plurality of print engine component capabilities using the defined data set, signal data and timing constraint data, the analyzing step including,
• instantiating each of the plurality of print engine component capability data sets to zero,
• normalizing each signal which defines the signal data,
• defining a reach-back value as a distance between a maximum start of a most recent interval associated with each signal and a minimum start of that signal's first interval,
• determining a minimum increment in accordance with timing constraint data of each data set,
• identifying a period defined from restricted intervals relative to a selected clock value, and
• defining a bound value in accordance with a maximum reach-back value and a period;
• obtaining component capability parameters of the plurality of print engine component capabilities based on the analyzing step of the plurality of print engine component capabilities;
• generating finite-state machines based on the obtained component capability parameters;
• and,
• scheduling a print engine using the generated finite-state machines.

A method for scheduling a machine using finite-state machines, the method comprising:

• receiving a plurality of machine component capabilities, each component capability being defined by a component capability data set;
• deriving signal data and timing constraint data from each data set, wherein
• signal data, defining a signal, is formed as a sequence of non-overlapping events on a corresponding machine component, an event being an action of the corresponding machine component associated with a time interval for completing an operation, and
• timing constraint data is defined as one of unary and binary interval constraints on the corresponding machine component;
• analyzing the plurality of machine component capabilities using the defined data set, signal data and timing constraint data, the analyzing step including,
• instantiating each of the plurality of machine component capability data sets to zero,
• normalizing each signal which defines the signal data,
• defining a reach-back value as a distance between a maximum start of a most recent interval associated with each signal and a minimum start of that signal's first interval,
• determining a minimum increment in accordance with timing constraint data of each data set,
• identifying a period defined from restricted intervals relative to a selected clock value, and
• defining a bound value in accordance with a maximum reach-back value and a period;
• obtaining component capability parameters of the plurality of machine component capabilities based on the analyzing step of the plurality of machine component capabilities;
• generating finite-state machines based on the obtained component capability parameters;
• and,
• scheduling a machine using the generated finite-state machines.